./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrspn_malloc.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrspn_malloc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f55019e0bbd691300fed0d54b866c64772e1d73ec8a359d22e1dcd292c7e1531 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:24,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:24,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:24,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:24,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:24,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:24,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:24,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:24,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:24,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:24,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:24,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:24,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:24,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:24,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:24,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:24,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:24,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:24,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:24,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:24,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:24,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:24,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:24,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:24,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:24,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:24,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:24,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:24,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:24,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:24,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:24,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:24,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:24,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:24,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:24,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:24,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:24,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:24,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:24,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:24,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:24,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:35:24,898 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:24,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:24,901 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:24,901 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:24,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:24,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:24,903 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:24,903 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:24,903 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:24,903 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:24,904 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:24,904 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:24,905 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:24,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:24,905 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:24,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:24,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:24,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:24,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:24,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:24,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:24,906 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:24,906 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:24,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:24,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:24,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:24,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:24,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:24,908 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:24,908 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> f55019e0bbd691300fed0d54b866c64772e1d73ec8a359d22e1dcd292c7e1531 [2022-02-21 03:35:25,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:25,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:25,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:25,155 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:25,156 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:25,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrspn_malloc.i [2022-02-21 03:35:25,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ac9107b/afef04027f6f4557a148afa83cd4d559/FLAGd25cbd33d [2022-02-21 03:35:25,687 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:25,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrspn_malloc.i [2022-02-21 03:35:25,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ac9107b/afef04027f6f4557a148afa83cd4d559/FLAGd25cbd33d [2022-02-21 03:35:26,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ac9107b/afef04027f6f4557a148afa83cd4d559 [2022-02-21 03:35:26,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:26,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:26,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:26,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:26,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:26,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fad8b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26, skipping insertion in model container [2022-02-21 03:35:26,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:26,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:26,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:26,420 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:26,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:26,507 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:26,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26 WrapperNode [2022-02-21 03:35:26,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:26,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:26,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:26,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:26,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,566 INFO L137 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2022-02-21 03:35:26,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:26,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:26,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:26,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:26,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:26,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:26,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:26,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:26,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26" (1/1) ... [2022-02-21 03:35:26,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:26,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:35:26,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:26,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:26,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:26,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:26,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:26,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:26,790 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:26,791 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:27,133 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:27,138 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:27,141 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:35:27,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:27 BoogieIcfgContainer [2022-02-21 03:35:27,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:27,145 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:27,146 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:27,149 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:27,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:27,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:26" (1/3) ... [2022-02-21 03:35:27,151 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e3267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:27, skipping insertion in model container [2022-02-21 03:35:27,151 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:27,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:26" (2/3) ... [2022-02-21 03:35:27,152 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e3267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:27, skipping insertion in model container [2022-02-21 03:35:27,152 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:27,152 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:27" (3/3) ... [2022-02-21 03:35:27,153 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrspn_malloc.i [2022-02-21 03:35:27,204 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:27,204 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:27,204 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:27,204 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:27,204 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:27,205 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:27,205 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:27,205 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:27,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:27,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:27,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:27,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:27,252 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:27,253 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:27,253 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:27,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:27,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:27,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:27,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:27,260 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:27,260 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:27,266 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 17#L382true assume !(main_~length1~0#1 < 1); 14#L382-2true assume !(main_~length2~0#1 < 1); 5#L385-1true call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 9#L369-4true [2022-02-21 03:35:27,267 INFO L793 eck$LassoCheckResult]: Loop: 9#L369-4true call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 16#L369-1true assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 7#L372-5true assume !true; 6#L372-6true call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 18#L374true assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; 10#L369-3true cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; 9#L369-4true [2022-02-21 03:35:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:27,272 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:35:27,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:27,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059203648] [2022-02-21 03:35:27,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:27,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,419 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,471 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:27,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:27,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2022-02-21 03:35:27,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:27,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218192071] [2022-02-21 03:35:27,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:27,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:27,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {24#true} is VALID [2022-02-21 03:35:27,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; {24#true} is VALID [2022-02-21 03:35:27,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-21 03:35:27,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {25#false} is VALID [2022-02-21 03:35:27,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; {25#false} is VALID [2022-02-21 03:35:27,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; {25#false} is VALID [2022-02-21 03:35:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:27,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:27,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218192071] [2022-02-21 03:35:27,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218192071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:27,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:27,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:35:27,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818333283] [2022-02-21 03:35:27,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:27,563 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:27,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:27,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:35:27,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:35:27,594 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:27,622 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:35:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:35:27,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:27,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:27,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2022-02-21 03:35:27,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:27,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2022-02-21 03:35:27,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:35:27,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:35:27,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:35:27,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:27,653 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:35:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:35:27,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:27,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:27,675 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:27,677 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:27,686 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:27,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:27,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:27,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 17 transitions. [2022-02-21 03:35:27,692 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 17 transitions. [2022-02-21 03:35:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:27,697 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:27,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:27,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:27,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:27,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:35:27,701 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:27,702 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:27,702 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:27,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:27,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:27,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:27,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:27,707 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:27,707 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:27,708 INFO L791 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 45#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 52#L382 assume !(main_~length1~0#1 < 1); 56#L382-2 assume !(main_~length2~0#1 < 1); 46#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 47#L369-4 [2022-02-21 03:35:27,708 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 53#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 50#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 51#L372-1 assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 55#L372-3 assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1; 48#L372-6 call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 49#L374 assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; 54#L369-3 cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; 47#L369-4 [2022-02-21 03:35:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:27,710 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2022-02-21 03:35:27,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:27,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960708243] [2022-02-21 03:35:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,738 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,754 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:27,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:27,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2022-02-21 03:35:27,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:27,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566715575] [2022-02-21 03:35:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:27,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,788 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,815 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2022-02-21 03:35:27,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:27,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132384295] [2022-02-21 03:35:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,903 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:27,952 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:28,762 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:28,763 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:28,763 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:28,763 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:28,763 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:28,763 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,763 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:28,763 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:28,764 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration2_Lasso [2022-02-21 03:35:28,764 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:28,764 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:28,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:29,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,314 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:30,317 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:30,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:30,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:30,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:30,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:30,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:30,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:30,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:30,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:30,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:35:30,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:30,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:30,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:30,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:35:30,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:30,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:30,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:30,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:30,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:30,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:30,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:30,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:30,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:30,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:30,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:30,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:30,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:30,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:30,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:30,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:30,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:30,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:30,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:35:30,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:30,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:30,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,490 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:30,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:35:30,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:30,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:30,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:30,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:30,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:30,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:30,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:30,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:30,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:30,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:30,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:30,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:30,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:30,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:30,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:30,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:35:30,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:30,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:30,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:30,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:30,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,604 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:30,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:35:30,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:30,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:30,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:30,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:30,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:30,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:30,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:30,637 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:30,669 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 03:35:30,669 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-02-21 03:35:30,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:30,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:30,695 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:30,718 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:30,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:35:30,740 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:30,740 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:30,741 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1, ULTIMATE.start_cstrspn_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0#1.offset Supporting invariants [] [2022-02-21 03:35:30,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:30,805 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 03:35:30,814 INFO L390 LassoCheck]: Loop: "call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);" "assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1;" "call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1;" "assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;" "call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);" "assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1;" "cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset;" [2022-02-21 03:35:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:30,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {92#unseeded} is VALID [2022-02-21 03:35:30,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {92#unseeded} is VALID [2022-02-21 03:35:30,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:30,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:30,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {136#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:30,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:31,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:31,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 03:35:31,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 03:35:31,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 03:35:31,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 03:35:31,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1; {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 03:35:31,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 03:35:31,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} is VALID [2022-02-21 03:35:31,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; {139#(and (= |ULTIMATE.start_cstrspn_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))))} is VALID [2022-02-21 03:35:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:31,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:31,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:31,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:31,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,149 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 [2022-02-21 03:35:31,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:31,230 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 28 transitions. Complement of second has 4 states. [2022-02-21 03:35:31,230 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 [2022-02-21 03:35:31,231 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:31,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:31,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:31,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:31,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:31,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:31,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:31,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:31,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:35:31,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:31,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:31,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:31,242 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:31,247 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:35:31,248 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:31,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:31,250 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:31,250 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:31,251 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:31,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:31,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:31,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:31,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:31,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:31,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:31,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:31,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:31,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:31,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:31,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:31,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:31,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:31,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:31,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:31,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:31,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:31,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:31,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:35:31,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:35:31,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:35:31,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:35:31,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:35:31,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:35:31,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:31,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:31,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:31,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:31,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:31,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:31,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:35:31,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:35:31,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:35:31,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:35:31,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:35:31,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:35:31,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:31,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:31,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:31,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:31,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:31,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:31,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:31,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:31,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:31,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:31,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:31,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:31,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:31,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:31,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:31,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:31,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:31,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:31,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,268 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:35:31,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:31,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:35:31,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:31,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:31,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:31,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:31,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2022-02-21 03:35:31,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:35:31,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:35:31,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 03:35:31,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:31,274 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 03:35:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:35:31,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:31,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:31,276 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:31,276 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:31,276 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:31,279 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:31,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:31,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:31,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 03:35:31,280 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 03:35:31,281 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:31,282 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:31,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:31,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:31,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:31,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 03:35:31,285 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:31,285 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:31,285 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:31,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:31,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:31,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:31,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:31,287 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:31,287 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:31,287 INFO L791 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 217#L382 assume !(main_~length1~0#1 < 1); 224#L382-2 assume !(main_~length2~0#1 < 1); 209#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 210#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 219#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 213#L372-5 [2022-02-21 03:35:31,288 INFO L793 eck$LassoCheckResult]: Loop: 213#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 214#L372-1 assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 222#L372-3 assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset; 213#L372-5 [2022-02-21 03:35:31,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:31,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2022-02-21 03:35:31,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:31,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624351546] [2022-02-21 03:35:31,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:31,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:31,310 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:31,324 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:31,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2022-02-21 03:35:31,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:31,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135454096] [2022-02-21 03:35:31,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:31,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:31,333 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:31,342 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:31,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2022-02-21 03:35:31,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:31,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835560438] [2022-02-21 03:35:31,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:31,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:31,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:31,398 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:32,017 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:32,018 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:32,018 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:32,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:32,018 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:32,018 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,018 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:32,018 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:32,018 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration3_Lasso [2022-02-21 03:35:32,018 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:32,018 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:32,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:32,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:33,415 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:33,416 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:33,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,420 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:35:33,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:35:33,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,458 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:35:33,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:33,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,484 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:35:33,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:33,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,516 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:35:33,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:33,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,546 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:35:33,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:33,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:33,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:33,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,613 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:35:33,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:33,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,641 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:35:33,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:33,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,668 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:35:33,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:33,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:33,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:33,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:33,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,696 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:35:33,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:33,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:33,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:33,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:33,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,739 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:35:33,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:33,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:33,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:33,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:33,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:33,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:33,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:33,791 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:33,813 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:35:33,813 INFO L444 ModelExtractionUtils]: 11 out of 37 variables were initially zero. Simplification set additionally 23 variables to zero. [2022-02-21 03:35:33,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:33,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:33,820 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:33,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:33,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:35:33,842 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:33,842 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:33,842 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_cstrspn_~s~0#1.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0#1.base)_2 Supporting invariants [] [2022-02-21 03:35:33,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:33,912 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2022-02-21 03:35:33,916 INFO L390 LassoCheck]: Loop: "call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1;" "assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset;" [2022-02-21 03:35:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:33,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:33,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:33,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:33,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {314#unseeded} is VALID [2022-02-21 03:35:33,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {314#unseeded} is VALID [2022-02-21 03:35:33,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#unseeded} assume !(main_~length1~0#1 < 1); {314#unseeded} is VALID [2022-02-21 03:35:33,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {314#unseeded} assume !(main_~length2~0#1 < 1); {314#unseeded} is VALID [2022-02-21 03:35:33,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {314#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {314#unseeded} is VALID [2022-02-21 03:35:33,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#unseeded} call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {314#unseeded} is VALID [2022-02-21 03:35:33,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {314#unseeded} assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; {314#unseeded} is VALID [2022-02-21 03:35:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:33,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:35:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:34,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {317#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|)))} call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; {400#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:35:34,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {400#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {400#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:35:34,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {400#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset; {377#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|)))))} is VALID [2022-02-21 03:35:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:34,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:34,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:34,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,040 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 [2022-02-21 03:35:34,040 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,083 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 57 transitions. Complement of second has 5 states. [2022-02-21 03:35:34,084 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 [2022-02-21 03:35:34,084 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:34,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:34,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:34,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:34,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:34,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:34,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:34,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2022-02-21 03:35:34,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:34,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:34,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:34,087 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:34,088 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:34,088 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:34,089 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:34,089 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:34,090 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:34,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:34,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:34,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:34,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:34,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:34,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:34,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:35:34,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:35:34,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:35:34,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:34,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:34,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:34,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:34,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:34,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:34,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:34,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:34,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:34,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:34,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:34,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:34,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:34,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:34,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:34,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:34,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:34,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:34,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:34,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:34,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:34,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:34,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:34,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:34,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:34,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,101 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 03:35:34,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:34,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:34,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:35:34,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:34,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:34,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:34,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2022-02-21 03:35:34,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:35:34,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:34,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2022-02-21 03:35:34,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:34,107 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-21 03:35:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2022-02-21 03:35:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-02-21 03:35:34,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:34,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,109 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,109 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,110 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:34,111 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:34,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:34,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:34,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states and 40 transitions. [2022-02-21 03:35:34,112 INFO L87 Difference]: Start difference. First operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states and 40 transitions. [2022-02-21 03:35:34,113 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:34,114 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:34,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:34,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:34,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:34,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-02-21 03:35:34,116 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:34,116 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:34,116 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:35:34,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2022-02-21 03:35:34,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:34,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:34,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:34,123 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:34,123 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:34,123 INFO L791 eck$LassoCheckResult]: Stem: 457#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 467#L382 assume !(main_~length1~0#1 < 1); 476#L382-2 assume !(main_~length2~0#1 < 1); 459#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 460#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 468#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 477#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 480#L372-1 assume !cstrspn_#t~short210#1; 478#L372-3 assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1; 461#L372-6 call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 462#L374 assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; 472#L369-3 cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; 469#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 471#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 463#L372-5 [2022-02-21 03:35:34,124 INFO L793 eck$LassoCheckResult]: Loop: 463#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 464#L372-1 assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 473#L372-3 assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset; 463#L372-5 [2022-02-21 03:35:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:34,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2022-02-21 03:35:34,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:34,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785110066] [2022-02-21 03:35:34,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:34,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:34,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:34,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {605#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {605#true} is VALID [2022-02-21 03:35:34,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {605#true} is VALID [2022-02-21 03:35:34,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume !(main_~length1~0#1 < 1); {605#true} is VALID [2022-02-21 03:35:34,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {605#true} assume !(main_~length2~0#1 < 1); {605#true} is VALID [2022-02-21 03:35:34,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {605#true} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {605#true} is VALID [2022-02-21 03:35:34,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#true} call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {607#(= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) |ULTIMATE.start_cstrspn_#t~mem206#1|)} is VALID [2022-02-21 03:35:34,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {607#(= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) |ULTIMATE.start_cstrspn_#t~mem206#1|)} assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; {608#(not (= |ULTIMATE.start_cstrspn_~c~0#1| 0))} is VALID [2022-02-21 03:35:34,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(not (= |ULTIMATE.start_cstrspn_~c~0#1| 0))} call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; {609#(or |ULTIMATE.start_cstrspn_#t~short210#1| (not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|)))} is VALID [2022-02-21 03:35:34,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#(or |ULTIMATE.start_cstrspn_#t~short210#1| (not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|)))} assume !cstrspn_#t~short210#1; {610#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:35:34,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1; {610#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:35:34,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {610#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {611#(not (= |ULTIMATE.start_cstrspn_#t~mem212#1| |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:35:34,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#(not (= |ULTIMATE.start_cstrspn_#t~mem212#1| |ULTIMATE.start_cstrspn_~c~0#1|))} assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; {606#false} is VALID [2022-02-21 03:35:34,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {606#false} cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; {606#false} is VALID [2022-02-21 03:35:34,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#false} call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {606#false} is VALID [2022-02-21 03:35:34,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {606#false} assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; {606#false} is VALID [2022-02-21 03:35:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:34,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:34,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785110066] [2022-02-21 03:35:34,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785110066] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:34,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:34,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:35:34,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003138597] [2022-02-21 03:35:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:34,235 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:35:34,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2022-02-21 03:35:34,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:34,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579655871] [2022-02-21 03:35:34,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:34,251 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:34,257 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:34,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:34,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:35:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:35:34,385 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:34,542 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-21 03:35:34,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:35:34,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:34,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2022-02-21 03:35:34,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:35:34,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2022-02-21 03:35:34,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:35:34,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:34,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2022-02-21 03:35:34,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:34,563 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-02-21 03:35:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2022-02-21 03:35:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-21 03:35:34,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:34,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,565 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,565 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,565 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:34,566 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:35:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:35:34,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:34,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:34,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states and 35 transitions. [2022-02-21 03:35:34,567 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states and 35 transitions. [2022-02-21 03:35:34,567 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:34,569 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:35:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:35:34,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:34,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:34,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:34,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-21 03:35:34,570 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 03:35:34,570 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 03:35:34,570 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:35:34,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2022-02-21 03:35:34,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:34,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:34,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:34,571 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:34,571 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:34,571 INFO L791 eck$LassoCheckResult]: Stem: 652#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 653#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 662#L382 assume !(main_~length1~0#1 < 1); 671#L382-2 assume !(main_~length2~0#1 < 1); 654#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 655#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 663#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 676#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 675#L372-1 assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 673#L372-3 assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1; 656#L372-6 call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 657#L374 assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; 667#L369-3 cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; 664#L369-4 call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 666#L369-1 assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; 658#L372-5 [2022-02-21 03:35:34,573 INFO L793 eck$LassoCheckResult]: Loop: 658#L372-5 call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; 659#L372-1 assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 668#L372-3 assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset; 658#L372-5 [2022-02-21 03:35:34,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:34,573 INFO L85 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2022-02-21 03:35:34,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:34,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058785192] [2022-02-21 03:35:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:34,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:34,614 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:34,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:34,615 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2022-02-21 03:35:34,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:34,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053241014] [2022-02-21 03:35:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:34,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:34,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:34,629 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2022-02-21 03:35:34,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:34,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962600995] [2022-02-21 03:35:34,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:34,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:34,660 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:34,678 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:35,531 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:35,532 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:35,532 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:35,532 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:35,532 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:35,532 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:35,532 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:35,532 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:35,532 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration5_Lasso [2022-02-21 03:35:35,532 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:35,532 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:35,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:35,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:35,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:35,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:35,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:36,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:37,323 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:37,324 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:37,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:37,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:37,325 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:37,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:35:37,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:37,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:37,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:37,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:37,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:37,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:37,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:37,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:37,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:37,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:37,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:37,355 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:37,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:35:37,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:37,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:37,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:37,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:37,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:37,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:37,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:37,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:37,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:37,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:37,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:37,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:37,383 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:37,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:35:37,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:37,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:37,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:37,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:37,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:37,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:37,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:37,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:37,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:37,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:35:37,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:37,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:37,409 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:37,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:35:37,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:37,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:37,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:37,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:37,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:37,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:37,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:37,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:37,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:37,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:37,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:37,437 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:37,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:35:37,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:37,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:37,446 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:35:37,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:37,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:37,464 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 03:35:37,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:37,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:37,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:37,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:37,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:37,508 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:37,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:35:37,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:37,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:37,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:37,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:37,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:37,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:37,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:37,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:37,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:35:37,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:37,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:37,549 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:37,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:35:37,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:37,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:37,558 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:35:37,558 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-02-21 03:35:37,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:37,631 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2022-02-21 03:35:37,631 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-02-21 03:35:37,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:37,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:37,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:37,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:37,786 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:37,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:35:37,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:37,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:37,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:37,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:37,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:37,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:37,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:37,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:37,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:35:37,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:37,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:37,842 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:37,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:35:37,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:37,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:37,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:37,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:37,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:37,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:37,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:37,926 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:37,965 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2022-02-21 03:35:37,966 INFO L444 ModelExtractionUtils]: 10 out of 46 variables were initially zero. Simplification set additionally 33 variables to zero. [2022-02-21 03:35:37,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:37,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:37,968 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:37,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:35:37,976 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:37,996 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:37,997 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:37,997 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_3) = -1*ULTIMATE.start_cstrspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_3 Supporting invariants [] [2022-02-21 03:35:38,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:38,120 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2022-02-21 03:35:38,125 INFO L390 LassoCheck]: Loop: "call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1;" "assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset;" [2022-02-21 03:35:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:38,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {800#unseeded} is VALID [2022-02-21 03:35:38,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {800#unseeded} is VALID [2022-02-21 03:35:38,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#unseeded} assume !(main_~length1~0#1 < 1); {800#unseeded} is VALID [2022-02-21 03:35:38,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {800#unseeded} assume !(main_~length2~0#1 < 1); {800#unseeded} is VALID [2022-02-21 03:35:38,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {800#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1; {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {965#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; {944#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:38,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))} call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; {996#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:35:38,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {996#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {996#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:35:38,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {996#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset; {947#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:38,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:38,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:38,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,367 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 [2022-02-21 03:35:38,367 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:38,435 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 51 transitions. Complement of second has 6 states. [2022-02-21 03:35:38,435 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 [2022-02-21 03:35:38,435 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:38,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:38,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:38,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:38,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:38,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:38,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:38,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:38,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:35:38,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:38,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:38,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:38,437 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:38,438 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:38,438 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:38,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:38,439 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:38,439 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:38,439 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:38,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:38,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:38,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:38,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:38,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:38,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:38,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:38,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:38,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:38,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,453 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:38,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,456 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:38,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {800#unseeded} is VALID [2022-02-21 03:35:38,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {800#unseeded} is VALID [2022-02-21 03:35:38,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#unseeded} assume !(main_~length1~0#1 < 1); {800#unseeded} is VALID [2022-02-21 03:35:38,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {800#unseeded} assume !(main_~length2~0#1 < 1); {800#unseeded} is VALID [2022-02-21 03:35:38,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {800#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1; {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; {944#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:38,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:38,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))} call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; {1102#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:35:38,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {1102#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1102#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:35:38,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {1102#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset; {947#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:38,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:38,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:38,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,683 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 [2022-02-21 03:35:38,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:38,732 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 51 transitions. Complement of second has 6 states. [2022-02-21 03:35:38,732 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 [2022-02-21 03:35:38,732 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:38,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:38,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:38,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:38,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:38,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:38,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:38,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:38,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:35:38,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:38,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:38,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:38,734 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:38,734 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:38,734 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:38,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:38,735 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:38,735 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:38,735 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:38,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:38,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:38,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:38,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:38,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:38,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:38,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:38,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:38,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:38,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:38,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:38,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:38,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,740 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:38,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,741 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:38,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:38,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {800#unseeded} is VALID [2022-02-21 03:35:38,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~res~0#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {800#unseeded} is VALID [2022-02-21 03:35:38,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {800#unseeded} assume !(main_~length1~0#1 < 1); {800#unseeded} is VALID [2022-02-21 03:35:38,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {800#unseeded} assume !(main_~length2~0#1 < 1); {800#unseeded} is VALID [2022-02-21 03:35:38,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {800#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem207#1, cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset, cstrspn_#t~mem208#1, cstrspn_#t~mem209#1, cstrspn_#t~short210#1, cstrspn_#t~mem212#1, cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset, cstrspn_#t~mem206#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1; {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem212#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !(cstrspn_#t~mem212#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem212#1; {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post205#1.base, 1 + cstrspn_#t~post205#1.offset;havoc cstrspn_#t~post205#1.base, cstrspn_#t~post205#1.offset; {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} call cstrspn_#t~mem206#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} is VALID [2022-02-21 03:35:38,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {1177#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|))} assume !!(0 != cstrspn_#t~mem206#1);havoc cstrspn_#t~mem206#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem207#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem207#1;havoc cstrspn_#t~mem207#1; {944#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:38,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:38,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))} call cstrspn_#t~mem208#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := 0 != cstrspn_#t~mem208#1; {1208#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:35:38,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1208#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short210#1;call cstrspn_#t~mem209#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short210#1 := cstrspn_#t~mem209#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1208#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:35:38,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {1208#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short210#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~mem209#1;havoc cstrspn_#t~short210#1;cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post211#1.base, 1 + cstrspn_#t~post211#1.offset;havoc cstrspn_#t~post211#1.base, cstrspn_#t~post211#1.offset; {947#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:38,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:38,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:38,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:38,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:38,971 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 [2022-02-21 03:35:38,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:39,041 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 53 transitions. Complement of second has 5 states. [2022-02-21 03:35:39,041 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 [2022-02-21 03:35:39,041 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:39,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:39,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:39,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:39,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:39,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:39,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:39,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:39,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2022-02-21 03:35:39,043 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:39,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:39,043 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:39,043 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:39,043 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:39,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:39,044 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:39,044 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:39,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:39,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:39,044 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:39,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:39,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:39,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:39,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:39,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:39,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:39,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:39,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:39,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:39,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:39,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:39,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:39,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:39,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:39,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:39,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:39,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:39,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:39,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:39,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:39,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:39,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:39,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:39,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:39,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:39,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:39,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:39,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,060 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-21 03:35:39,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:39,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:39,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:35:39,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:39,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:39,067 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:39,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2022-02-21 03:35:39,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:39,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:39,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:39,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:39,074 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:39,074 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:39,074 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:39,075 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:35:39,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:39,075 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:39,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:39,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:35:39 BoogieIcfgContainer [2022-02-21 03:35:39,081 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:39,081 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:39,081 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:39,081 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:39,082 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:27" (3/4) ... [2022-02-21 03:35:39,083 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:39,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:39,084 INFO L158 Benchmark]: Toolchain (without parser) took 13038.67ms. Allocated memory was 96.5MB in the beginning and 161.5MB in the end (delta: 65.0MB). Free memory was 62.3MB in the beginning and 83.0MB in the end (delta: -20.8MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2022-02-21 03:35:39,085 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:39,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.57ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 61.9MB in the end (delta: 212.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:35:39,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.11ms. Allocated memory is still 96.5MB. Free memory was 61.9MB in the beginning and 59.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:39,086 INFO L158 Benchmark]: Boogie Preprocessor took 53.54ms. Allocated memory is still 96.5MB. Free memory was 59.4MB in the beginning and 57.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:39,086 INFO L158 Benchmark]: RCFGBuilder took 522.39ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 57.4MB in the beginning and 108.4MB in the end (delta: -51.0MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2022-02-21 03:35:39,086 INFO L158 Benchmark]: BuchiAutomizer took 11935.89ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 108.4MB in the beginning and 84.1MB in the end (delta: 24.3MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2022-02-21 03:35:39,087 INFO L158 Benchmark]: Witness Printer took 2.29ms. Allocated memory is still 161.5MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:39,089 INFO L339 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.18ms. Allocated memory is still 71.3MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.57ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 61.9MB in the end (delta: 212.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.11ms. Allocated memory is still 96.5MB. Free memory was 61.9MB in the beginning and 59.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.54ms. Allocated memory is still 96.5MB. Free memory was 59.4MB in the beginning and 57.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.39ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 57.4MB in the beginning and 108.4MB in the end (delta: -51.0MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 11935.89ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 108.4MB in the beginning and 84.1MB in the end (delta: 24.3MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * Witness Printer took 2.29ms. Allocated memory is still 161.5MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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[nondetString1] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -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 11.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.8s. Construction of modules took 0.1s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.1s 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: 0 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 106 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital259 mio100 ax100 hnf100 lsp103 ukn73 mio100 lsp30 div151 bol100 ite100 ukn100 eq155 hnf96 smp77 dnf633 smp42 tf100 neg95 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 217ms 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! [2022-02-21 03:35:39,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE