./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_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/cstrcspn_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 dea536aba24bbbd149deffc3b8406a97f6fac760a5b2f50471455440f523d7fc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:01,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:01,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:01,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:01,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:01,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:01,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:01,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:01,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:01,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:01,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:01,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:01,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:01,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:01,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:01,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:01,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:01,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:01,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:01,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:01,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:01,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:01,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:01,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:01,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:01,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:01,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:01,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:01,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:01,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:01,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:01,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:01,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:01,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:01,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:01,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:01,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:01,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:01,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:01,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:01,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:01,232 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:01,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:01,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:01,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:01,267 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:01,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:01,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:01,269 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:01,269 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:01,269 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:01,269 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:01,270 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:01,270 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:01,271 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:01,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:01,271 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:01,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:01,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:01,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:01,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:01,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:01,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:01,272 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:01,272 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:01,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:01,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:01,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:01,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:01,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:01,275 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:01,275 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 -> dea536aba24bbbd149deffc3b8406a97f6fac760a5b2f50471455440f523d7fc [2022-02-21 03:35:01,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:01,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:01,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:01,490 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:01,491 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:01,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_malloc.i [2022-02-21 03:35:01,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4172adbc5/c14c733ec3d04b4f84a52fd0478a6cc5/FLAGd20d425a7 [2022-02-21 03:35:02,015 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:02,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_malloc.i [2022-02-21 03:35:02,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4172adbc5/c14c733ec3d04b4f84a52fd0478a6cc5/FLAGd20d425a7 [2022-02-21 03:35:02,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4172adbc5/c14c733ec3d04b4f84a52fd0478a6cc5 [2022-02-21 03:35:02,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:02,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:02,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:02,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:02,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:02,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:02" (1/1) ... [2022-02-21 03:35:02,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601aa09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:02, skipping insertion in model container [2022-02-21 03:35:02,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:02" (1/1) ... [2022-02-21 03:35:02,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:02,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:02,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:02,632 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:02,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:02,714 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:02,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:02 WrapperNode [2022-02-21 03:35:02,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:02,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:02,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:02,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:02,721 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:02" (1/1) ... [2022-02-21 03:35:02,737 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:02" (1/1) ... [2022-02-21 03:35:02,772 INFO L137 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2022-02-21 03:35:02,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:02,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:02,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:02,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:02,780 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:02" (1/1) ... [2022-02-21 03:35:02,781 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:02" (1/1) ... [2022-02-21 03:35:02,786 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:02" (1/1) ... [2022-02-21 03:35:02,786 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:02" (1/1) ... [2022-02-21 03:35:02,807 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:02" (1/1) ... [2022-02-21 03:35:02,810 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:02" (1/1) ... [2022-02-21 03:35:02,811 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:02" (1/1) ... [2022-02-21 03:35:02,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:02,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:02,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:02,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:02,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:02" (1/1) ... [2022-02-21 03:35:02,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:02,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:02,854 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:02,865 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:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:02,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:02,970 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:02,972 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:03,199 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:03,214 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:03,215 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:35:03,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:03 BoogieIcfgContainer [2022-02-21 03:35:03,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:03,217 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:03,217 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:03,219 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:03,220 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:03,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:02" (1/3) ... [2022-02-21 03:35:03,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b888412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:03, skipping insertion in model container [2022-02-21 03:35:03,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:03,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:02" (2/3) ... [2022-02-21 03:35:03,222 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b888412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:03, skipping insertion in model container [2022-02-21 03:35:03,222 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:03,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:03" (3/3) ... [2022-02-21 03:35:03,223 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrcspn_malloc.i [2022-02-21 03:35:03,267 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:03,267 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:03,267 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:03,267 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:03,267 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:03,267 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:03,268 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:03,268 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:03,287 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:03,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:03,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:03,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:03,310 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:03,310 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:03,311 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:03,311 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:03,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:03,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:03,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:03,316 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:03,316 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:03,320 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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 9#L369-4true [2022-02-21 03:35:03,321 INFO L793 eck$LassoCheckResult]: Loop: 9#L369-4true call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 16#L369-1true assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; 7#L372-5true assume !true; 6#L372-6true call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 18#L374true assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; 10#L369-3true cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; 9#L369-4true [2022-02-21 03:35:03,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:35:03,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:03,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857278355] [2022-02-21 03:35:03,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:03,468 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:03,511 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:03,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:03,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2022-02-21 03:35:03,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:03,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443371530] [2022-02-21 03:35:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:03,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:03,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {24#true} is VALID [2022-02-21 03:35:03,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {24#true} is VALID [2022-02-21 03:35:03,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-21 03:35:03,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {25#false} is VALID [2022-02-21 03:35:03,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; {25#false} is VALID [2022-02-21 03:35:03,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; {25#false} is VALID [2022-02-21 03:35:03,578 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:03,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:03,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443371530] [2022-02-21 03:35:03,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443371530] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:03,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:03,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:35:03,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554861489] [2022-02-21 03:35:03,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:03,585 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:03,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:03,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:35:03,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:35:03,610 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:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:03,635 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:35:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:35:03,637 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:03,659 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:03,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2022-02-21 03:35:03,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:03,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2022-02-21 03:35:03,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:35:03,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:35:03,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:35:03,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:03,679 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:03,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:35:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:35:03,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:03,697 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:03,698 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:03,699 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:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:03,707 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:03,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:03,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:03,709 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:03,709 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:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:03,712 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:03,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:03,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:03,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:03,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:03,714 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:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:35:03,716 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:03,716 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:03,717 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:03,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:03,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:03,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:03,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:03,720 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:03,721 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:03,721 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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 47#L369-4 [2022-02-21 03:35:03,721 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 53#L369-1 assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; 50#L372-5 call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; 51#L372-1 assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 55#L372-3 assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; 48#L372-6 call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 49#L374 assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; 54#L369-3 cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; 47#L369-4 [2022-02-21 03:35:03,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:03,722 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2022-02-21 03:35:03,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:03,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434367778] [2022-02-21 03:35:03,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:03,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:03,756 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:03,775 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2022-02-21 03:35:03,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:03,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165933802] [2022-02-21 03:35:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:03,804 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:03,822 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2022-02-21 03:35:03,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:03,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994796467] [2022-02-21 03:35:03,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:03,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:03,874 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:03,897 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:04,589 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:04,590 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:04,590 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:04,590 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:04,590 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:04,590 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:04,591 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:04,591 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:04,591 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc.i_Iteration2_Lasso [2022-02-21 03:35:04,591 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:04,591 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:04,617 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:04,621 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:04,623 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:04,625 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:04,629 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:05,000 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:05,003 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:05,005 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:05,007 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:05,010 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:05,012 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:05,014 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:05,017 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:05,019 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:05,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:05,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:05,024 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:05,026 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:05,028 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:05,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:05,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:05,034 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:05,036 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:05,895 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:05,898 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:05,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:05,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:05,901 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:05,902 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:05,903 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:05,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:05,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:05,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:05,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:05,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:05,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:05,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:05,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:05,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:35:05,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:05,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:05,940 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:05,940 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:05,942 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:05,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:05,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:05,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:05,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:05,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:05,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:05,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:05,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:05,978 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:05,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:05,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:05,980 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:05,981 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:05,982 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:05,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:05,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:05,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:05,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:05,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:05,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:05,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:05,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:06,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:35:06,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:06,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:06,009 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:06,010 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:06,011 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:06,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:06,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:06,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:06,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:06,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:06,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:06,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:06,076 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:06,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:06,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:06,080 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:06,091 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:06,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:06,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:06,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:06,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:06,098 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:06,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:06,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:06,119 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:06,165 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 03:35:06,165 INFO L444 ModelExtractionUtils]: 13 out of 25 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-02-21 03:35:06,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:06,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:06,207 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:06,268 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:06,277 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:06,278 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:06,278 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:06,279 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1, ULTIMATE.start_cstrcspn_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset Supporting invariants [] [2022-02-21 03:35:06,294 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:06,320 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 03:35:06,328 INFO L390 LassoCheck]: Loop: "call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1;" "call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1;" "assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;" "call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);" "assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1;" "cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset;" [2022-02-21 03:35:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:06,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:06,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:06,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:06,411 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:06,412 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:06,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:06,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:06,413 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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {136#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:06,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:06,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:06,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:35:06,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:35:06,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:35:06,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:35:06,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:35:06,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:35:06,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:35:06,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#(and (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (<= (+ |ULTIMATE.start_cstrcspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|)))} cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; {139#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))) (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|))} is VALID [2022-02-21 03:35:06,581 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:06,583 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:06,595 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:06,597 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:06,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,600 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:06,601 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:06,679 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:06,679 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:06,679 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:06,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:06,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:06,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:06,681 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:06,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:06,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:06,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:06,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:35:06,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:06,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:06,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:06,689 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:06,693 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:35:06,695 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:06,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:06,698 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:06,698 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:06,699 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:06,699 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:06,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,699 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:06,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,700 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:06,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,701 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:06,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,701 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:06,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,702 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:06,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,702 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:06,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,702 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:06,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,703 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:06,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,703 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:06,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,705 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:06,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,705 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:06,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,705 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:06,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,706 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:06,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,706 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:06,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,706 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:06,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,707 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:06,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,707 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:06,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,707 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:06,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,708 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:06,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,709 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:06,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,709 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:06,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,710 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:06,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,710 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:06,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,711 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:06,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,711 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:06,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,712 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:06,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,712 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:06,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,712 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:06,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,713 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:06,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,713 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:06,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,713 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:06,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,714 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:06,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,714 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:06,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,714 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:06,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,715 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:06,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,715 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:06,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,715 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:06,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,716 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:06,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,716 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:06,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,716 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:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,717 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:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,717 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:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,717 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:06,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,718 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:06,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,718 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:06,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,718 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:06,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,719 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:06,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,719 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:06,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,719 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:06,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,720 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:06,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,720 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:06,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,720 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:06,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,721 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:06,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,721 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:06,722 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:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:35:06,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:06,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:35:06,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:06,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:06,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:06,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:06,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2022-02-21 03:35:06,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:35:06,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:35:06,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 03:35:06,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:06,727 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 03:35:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:35:06,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:06,728 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:06,728 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:06,729 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:06,729 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:06,731 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:06,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:06,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:06,732 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:06,733 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:06,733 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:06,734 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:06,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:06,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:06,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:06,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:06,735 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:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 03:35:06,736 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:06,736 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:06,737 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:06,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:06,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:06,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:06,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:06,738 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:06,738 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:06,738 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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 210#L369-4 call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 219#L369-1 assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; 213#L372-5 [2022-02-21 03:35:06,738 INFO L793 eck$LassoCheckResult]: Loop: 213#L372-5 call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; 214#L372-1 assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 222#L372-3 assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; 213#L372-5 [2022-02-21 03:35:06,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2022-02-21 03:35:06,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:06,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203311000] [2022-02-21 03:35:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:06,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:06,770 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:06,791 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2022-02-21 03:35:06,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:06,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638098445] [2022-02-21 03:35:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:06,802 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:06,806 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:06,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:06,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2022-02-21 03:35:06,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:06,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585385183] [2022-02-21 03:35:06,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:06,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:06,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:06,880 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:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:06,892 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:07,369 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:07,369 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:07,370 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:07,370 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:07,370 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:07,370 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,370 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:07,370 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:07,370 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc.i_Iteration3_Lasso [2022-02-21 03:35:07,370 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:07,370 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:07,373 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:07,375 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:07,377 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:07,380 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:07,382 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:07,384 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:07,386 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:07,388 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:07,390 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:07,392 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:07,394 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:07,397 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:07,399 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:07,401 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:07,403 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:07,405 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:07,408 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:07,410 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:07,412 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:07,414 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:07,417 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:07,419 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:07,421 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:08,616 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:08,617 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:08,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:08,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:08,618 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:08,619 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:08,621 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:08,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:08,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:08,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:08,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:08,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:08,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:08,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:08,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:08,664 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:08,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:08,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:08,666 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:08,666 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:08,667 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:08,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:08,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:08,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:08,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:08,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:08,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:08,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:08,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:08,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:08,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:08,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:08,695 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:08,696 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:08,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:08,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:08,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:08,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:08,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:08,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:08,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:08,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:08,738 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:08,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:08,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:08,739 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:08,759 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:08,760 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:08,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:08,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:08,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:08,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:08,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:08,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:08,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:08,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:08,788 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:08,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:08,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:08,789 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:08,790 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:08,791 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:08,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:08,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:08,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:08,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:08,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:08,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:08,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:08,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:08,814 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:08,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:08,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:08,815 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:08,816 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:08,817 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:08,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:08,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:08,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:08,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:08,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:08,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:08,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:08,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:08,861 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:08,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:08,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:08,862 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:08,864 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:08,928 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:08,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:08,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:08,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:08,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:08,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:08,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:08,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:08,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:08,952 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:08,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:08,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:08,953 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:08,953 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:08,954 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:08,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:08,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:08,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:08,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:08,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:08,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:08,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:08,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:08,977 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:08,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:08,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:08,979 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:08,979 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:08,981 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:08,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:08,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:08,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:08,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:08,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:08,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:08,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,048 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:09,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,049 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:09,050 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:09,051 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:09,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,074 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:09,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,075 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:09,076 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:09,077 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:09,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:09,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:09,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,103 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:09,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,104 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:09,105 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:09,107 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:09,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,147 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:09,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,149 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:09,154 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:09,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,164 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:09,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,193 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:09,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,194 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:09,209 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:09,210 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:09,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 03:35:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,239 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:09,240 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:09,241 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:09,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,271 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:09,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,272 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:09,273 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:09,275 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:09,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,305 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:09,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,306 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:09,307 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:09,309 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:09,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,348 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:09,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,349 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:09,351 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:09,351 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:09,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,390 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:09,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,391 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:09,392 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:09,409 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:09,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:35:09,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,451 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:09,451 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:09,453 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:09,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:09,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,484 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:09,486 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:09,487 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:09,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:35:09,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,526 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:09,527 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:09,528 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:09,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:09,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:09,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:09,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:35:09,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,556 INFO L229 MonitoredProcess]: Starting monitored process 30 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:09,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:35:09,558 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:09,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:09,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:09,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:09,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,603 INFO L229 MonitoredProcess]: Starting monitored process 31 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:09,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:35:09,606 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:09,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,614 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:35:09,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,623 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 03:35:09,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:09,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:09,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,655 INFO L229 MonitoredProcess]: Starting monitored process 32 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:09,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:35:09,657 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:09,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:09,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:09,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:35:09,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,695 INFO L229 MonitoredProcess]: Starting monitored process 33 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:09,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:35:09,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:09,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:09,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:09,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 03:35:09,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,744 INFO L229 MonitoredProcess]: Starting monitored process 34 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:09,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:35:09,748 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:09,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:09,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:09,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:09,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,797 INFO L229 MonitoredProcess]: Starting monitored process 35 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:09,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:35:09,799 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:09,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:09,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:09,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:09,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,840 INFO L229 MonitoredProcess]: Starting monitored process 36 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:09,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:35:09,843 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:09,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:09,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:09,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:09,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:35:09,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,883 INFO L229 MonitoredProcess]: Starting monitored process 37 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:09,898 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:09,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:35:09,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:09,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:09,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:09,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:09,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:09,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:09,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:09,959 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:35:09,959 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-02-21 03:35:09,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:09,962 INFO L229 MonitoredProcess]: Starting monitored process 38 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:09,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:35:09,966 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:09,987 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:09,987 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:09,987 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2022-02-21 03:35:10,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:35:10,056 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2022-02-21 03:35:10,061 INFO L390 LassoCheck]: Loop: "call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1;" "assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset;" [2022-02-21 03:35:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:10,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:10,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:10,135 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:10,135 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:10,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#unseeded} assume !(main_~length1~0#1 < 1); {314#unseeded} is VALID [2022-02-21 03:35:10,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {314#unseeded} assume !(main_~length2~0#1 < 1); {314#unseeded} is VALID [2022-02-21 03:35:10,137 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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {399#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:10,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {399#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:10,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {378#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:10,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:10,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:10,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {379#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {406#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))))} is VALID [2022-02-21 03:35:10,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))))} assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {406#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))))} is VALID [2022-02-21 03:35:10,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))))} assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {381#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded))} is VALID [2022-02-21 03:35:10,204 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:10,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,214 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:10,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,214 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:10,214 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 6 states. [2022-02-21 03:35:10,289 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:10,289 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:10,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:10,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:10,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:10,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:10,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:10,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:10,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2022-02-21 03:35:10,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:10,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:10,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:10,292 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:10,292 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:10,293 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:10,293 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:10,294 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:10,294 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:10,294 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:10,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,295 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:10,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:10,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 2 letters. Loop has 2 letters. [2022-02-21 03:35:10,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:10,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,296 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:10,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,297 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:10,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,297 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:10,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,297 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:10,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,297 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:10,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,298 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:10,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:10,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 4 letters. Loop has 4 letters. [2022-02-21 03:35:10,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:10,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,299 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:10,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,299 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:10,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,300 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:10,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,300 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:10,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,300 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:10,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,301 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:10,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:10,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 2 letters. Loop has 2 letters. [2022-02-21 03:35:10,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:10,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,302 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:10,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,302 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:10,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,302 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:10,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,303 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:10,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,303 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:10,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,304 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:10,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,304 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:10,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:10,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:10,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:35:10,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:10,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:10,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:10,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2022-02-21 03:35:10,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:35:10,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:10,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2022-02-21 03:35:10,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:10,308 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-21 03:35:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2022-02-21 03:35:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-02-21 03:35:10,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:10,310 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:10,310 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:10,310 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:10,311 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:10,312 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:10,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:10,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:10,312 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:10,312 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:10,312 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:10,314 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:10,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:10,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:10,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:10,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:10,314 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:10,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-02-21 03:35:10,315 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:10,315 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:10,315 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:35:10,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2022-02-21 03:35:10,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:10,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:10,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:10,332 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:10,332 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:10,332 INFO L791 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 467#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; 476#L382 assume !(main_~length1~0#1 < 1); 485#L382-2 assume !(main_~length2~0#1 < 1); 468#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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 469#L369-4 call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 477#L369-1 assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; 486#L372-5 call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; 489#L372-1 assume !cstrcspn_#t~short210#1; 487#L372-3 assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; 470#L372-6 call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 471#L374 assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; 481#L369-3 cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; 478#L369-4 call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 480#L369-1 assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; 472#L372-5 [2022-02-21 03:35:10,332 INFO L793 eck$LassoCheckResult]: Loop: 472#L372-5 call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; 473#L372-1 assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 482#L372-3 assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; 472#L372-5 [2022-02-21 03:35:10,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2022-02-21 03:35:10,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:10,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486130251] [2022-02-21 03:35:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:10,350 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:10,371 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:10,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:10,371 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2022-02-21 03:35:10,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:10,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989833390] [2022-02-21 03:35:10,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:10,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:10,379 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:10,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:10,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2022-02-21 03:35:10,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:10,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721629659] [2022-02-21 03:35:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:10,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {618#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {618#true} is VALID [2022-02-21 03:35:10,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#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; {618#true} is VALID [2022-02-21 03:35:10,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {618#true} assume !(main_~length1~0#1 < 1); {618#true} is VALID [2022-02-21 03:35:10,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {618#true} assume !(main_~length2~0#1 < 1); {618#true} is VALID [2022-02-21 03:35:10,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {618#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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {618#true} is VALID [2022-02-21 03:35:10,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {618#true} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {618#true} is VALID [2022-02-21 03:35:10,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#true} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {620#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:10,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {620#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {621#(or |ULTIMATE.start_cstrcspn_#t~short210#1| (and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|)))} is VALID [2022-02-21 03:35:10,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#(or |ULTIMATE.start_cstrcspn_#t~short210#1| (and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|)))} assume !cstrcspn_#t~short210#1; {622#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:10,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {622#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; {622#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:10,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {622#(and (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:10,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:10,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:10,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:10,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {624#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)} is VALID [2022-02-21 03:35:10,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {624#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {625#(not |ULTIMATE.start_cstrcspn_#t~short210#1|)} is VALID [2022-02-21 03:35:10,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {625#(not |ULTIMATE.start_cstrcspn_#t~short210#1|)} assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {619#false} is VALID [2022-02-21 03:35:10,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {619#false} assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {619#false} is VALID [2022-02-21 03:35:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:10,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:10,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721629659] [2022-02-21 03:35:10,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721629659] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:10,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17289346] [2022-02-21 03:35:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:10,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:10,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:10,490 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:10,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-02-21 03:35:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:10,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-21 03:35:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:10,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:10,630 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 03:35:10,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-21 03:35:10,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:10,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {618#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {618#true} is VALID [2022-02-21 03:35:10,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#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; {618#true} is VALID [2022-02-21 03:35:10,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {618#true} assume !(main_~length1~0#1 < 1); {618#true} is VALID [2022-02-21 03:35:10,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {618#true} assume !(main_~length2~0#1 < 1); {618#true} is VALID [2022-02-21 03:35:10,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {618#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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {641#(= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0)} is VALID [2022-02-21 03:35:10,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#(= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0)} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {641#(= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0)} is VALID [2022-02-21 03:35:10,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#(= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0)} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {648#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:10,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {648#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| |ULTIMATE.start_cstrcspn_~s2#1.offset|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {652#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (or (and |ULTIMATE.start_cstrcspn_#t~short210#1| (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))) (and (not |ULTIMATE.start_cstrcspn_#t~short210#1|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))))} is VALID [2022-02-21 03:35:10,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {652#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (or (and |ULTIMATE.start_cstrcspn_#t~short210#1| (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))) (and (not |ULTIMATE.start_cstrcspn_#t~short210#1|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))))} assume !cstrcspn_#t~short210#1; {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 03:35:10,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 03:35:10,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 03:35:10,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 03:35:10,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 03:35:10,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 03:35:10,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {656#(and (= |ULTIMATE.start_cstrcspn_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {675#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) 0) 0) (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| 0))} is VALID [2022-02-21 03:35:10,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#(and (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) 0) 0) (= |ULTIMATE.start_cstrcspn_~s~0#1.offset| 0))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {625#(not |ULTIMATE.start_cstrcspn_#t~short210#1|)} is VALID [2022-02-21 03:35:10,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {625#(not |ULTIMATE.start_cstrcspn_#t~short210#1|)} assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {619#false} is VALID [2022-02-21 03:35:10,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {619#false} assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {619#false} is VALID [2022-02-21 03:35:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:10,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:10,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {619#false} assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {619#false} is VALID [2022-02-21 03:35:10,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {625#(not |ULTIMATE.start_cstrcspn_#t~short210#1|)} assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {619#false} is VALID [2022-02-21 03:35:10,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {624#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {625#(not |ULTIMATE.start_cstrcspn_#t~short210#1|)} is VALID [2022-02-21 03:35:10,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {624#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)} is VALID [2022-02-21 03:35:10,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:10,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:10,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:10,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:10,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:10,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#(or |ULTIMATE.start_cstrcspn_#t~short210#1| (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} assume !cstrcspn_#t~short210#1; {623#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:10,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {712#(or |ULTIMATE.start_cstrcspn_#t~short210#1| (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 03:35:10,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#true} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {716#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s~0#1.base|) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0))} is VALID [2022-02-21 03:35:10,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {618#true} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {618#true} is VALID [2022-02-21 03:35:10,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {618#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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {618#true} is VALID [2022-02-21 03:35:10,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {618#true} assume !(main_~length2~0#1 < 1); {618#true} is VALID [2022-02-21 03:35:10,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {618#true} assume !(main_~length1~0#1 < 1); {618#true} is VALID [2022-02-21 03:35:10,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#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; {618#true} is VALID [2022-02-21 03:35:10,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {618#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {618#true} is VALID [2022-02-21 03:35:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:10,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17289346] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:10,865 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:10,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2022-02-21 03:35:10,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031901632] [2022-02-21 03:35:10,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:10,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:10,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:35:10,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:35:10,964 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:11,295 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-02-21 03:35:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:35:11,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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:11,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:11,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2022-02-21 03:35:11,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:11,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2022-02-21 03:35:11,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:35:11,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:35:11,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2022-02-21 03:35:11,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:11,340 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-02-21 03:35:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2022-02-21 03:35:11,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2022-02-21 03:35:11,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:11,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 53 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 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:11,350 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 53 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 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:11,350 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 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:11,350 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:11,352 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-21 03:35:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-21 03:35:11,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:11,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:11,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 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 43 states and 53 transitions. [2022-02-21 03:35:11,353 INFO L87 Difference]: Start difference. First operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 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 43 states and 53 transitions. [2022-02-21 03:35:11,353 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:11,354 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-21 03:35:11,354 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-21 03:35:11,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:11,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:11,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:11,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 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:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-21 03:35:11,355 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-21 03:35:11,355 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-21 03:35:11,355 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:35:11,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2022-02-21 03:35:11,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:11,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:11,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:11,356 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:11,356 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:11,356 INFO L791 eck$LassoCheckResult]: Stem: 803#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 804#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; 813#L382 assume !(main_~length1~0#1 < 1); 822#L382-2 assume !(main_~length2~0#1 < 1); 805#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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 806#L369-4 call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 814#L369-1 assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; 827#L372-5 call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; 820#L372-1 assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 821#L372-3 assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; 807#L372-6 call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 808#L374 assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; 818#L369-3 cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; 815#L369-4 call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 816#L369-1 assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; 809#L372-5 [2022-02-21 03:35:11,357 INFO L793 eck$LassoCheckResult]: Loop: 809#L372-5 call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; 810#L372-1 assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 819#L372-3 assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; 809#L372-5 [2022-02-21 03:35:11,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:11,357 INFO L85 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2022-02-21 03:35:11,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:11,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386536179] [2022-02-21 03:35:11,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:11,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:11,398 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:11,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:11,398 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2022-02-21 03:35:11,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:11,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186043307] [2022-02-21 03:35:11,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:11,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:11,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:11,407 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2022-02-21 03:35:11,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:11,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704754174] [2022-02-21 03:35:11,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:11,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:11,428 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:11,469 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:12,372 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:12,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:12,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:12,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:12,372 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:12,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:12,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:12,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:12,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc.i_Iteration5_Lasso [2022-02-21 03:35:12,373 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:12,373 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:12,375 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:12,377 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:12,379 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:12,381 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:12,383 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:12,384 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:12,387 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:12,389 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:12,390 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:12,392 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:12,393 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:12,395 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:12,397 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:12,398 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:12,401 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:12,403 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:12,980 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:12,983 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:12,989 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:12,991 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:12,992 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:12,994 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:12,995 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:14,221 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:14,222 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:14,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,223 INFO L229 MonitoredProcess]: Starting monitored process 40 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:14,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:35:14,236 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:14,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 03:35:14,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,261 INFO L229 MonitoredProcess]: Starting monitored process 41 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:14,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:35:14,263 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:14,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 03:35:14,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,294 INFO L229 MonitoredProcess]: Starting monitored process 42 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:14,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:35:14,296 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:14,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:14,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:14,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:35:14,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,328 INFO L229 MonitoredProcess]: Starting monitored process 43 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:14,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:35:14,330 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:14,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:35:14,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,357 INFO L229 MonitoredProcess]: Starting monitored process 44 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:14,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:35:14,359 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:14,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:35:14,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,398 INFO L229 MonitoredProcess]: Starting monitored process 45 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:14,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:35:14,399 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:14,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 03:35:14,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,425 INFO L229 MonitoredProcess]: Starting monitored process 46 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:14,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:35:14,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:14,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:35:14,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,454 INFO L229 MonitoredProcess]: Starting monitored process 47 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:14,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:35:14,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:14,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 03:35:14,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,485 INFO L229 MonitoredProcess]: Starting monitored process 48 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:14,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:35:14,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:14,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 03:35:14,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,521 INFO L229 MonitoredProcess]: Starting monitored process 49 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:14,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:35:14,523 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:14,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:14,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,562 INFO L229 MonitoredProcess]: Starting monitored process 50 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:14,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:35:14,564 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:14,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:14,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,598 INFO L229 MonitoredProcess]: Starting monitored process 51 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:14,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:35:14,600 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:14,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:14,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,626 INFO L229 MonitoredProcess]: Starting monitored process 52 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:14,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:35:14,628 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:14,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-02-21 03:35:14,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,655 INFO L229 MonitoredProcess]: Starting monitored process 53 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:14,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:35:14,658 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:14,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:14,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:14,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 03:35:14,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,693 INFO L229 MonitoredProcess]: Starting monitored process 54 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:14,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:35:14,695 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:14,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:14,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:14,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:14,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:14,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,734 INFO L229 MonitoredProcess]: Starting monitored process 55 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:14,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:35:14,736 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:14,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:14,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:14,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-02-21 03:35:14,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,764 INFO L229 MonitoredProcess]: Starting monitored process 56 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:14,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:35:14,766 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:14,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,772 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:35:14,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,781 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 03:35:14,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:14,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-02-21 03:35:14,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,824 INFO L229 MonitoredProcess]: Starting monitored process 57 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:14,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 03:35:14,826 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:14,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:14,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:14,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:14,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,855 INFO L229 MonitoredProcess]: Starting monitored process 58 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:14,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 03:35:14,857 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:14,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:14,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:14,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-02-21 03:35:14,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,882 INFO L229 MonitoredProcess]: Starting monitored process 59 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:14,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 03:35:14,884 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:14,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:14,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:14,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-02-21 03:35:14,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,914 INFO L229 MonitoredProcess]: Starting monitored process 60 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:14,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 03:35:14,916 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:14,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:14,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:14,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:14,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:14,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:14,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:14,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-02-21 03:35:14,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:14,941 INFO L229 MonitoredProcess]: Starting monitored process 61 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:14,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 03:35:14,943 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:14,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:14,949 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2022-02-21 03:35:14,949 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-02-21 03:35:14,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:15,032 INFO L401 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2022-02-21 03:35:15,032 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-02-21 03:35:15,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:15,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-02-21 03:35:15,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:15,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:15,244 INFO L229 MonitoredProcess]: Starting monitored process 62 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:15,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 03:35:15,247 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:15,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:15,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:15,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:15,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:15,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:15,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:15,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:15,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-02-21 03:35:15,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:15,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:15,283 INFO L229 MonitoredProcess]: Starting monitored process 63 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:15,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 03:35:15,285 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:15,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:15,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:15,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:15,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:15,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:15,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:15,309 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:15,321 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:35:15,321 INFO L444 ModelExtractionUtils]: 20 out of 37 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-02-21 03:35:15,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:15,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:15,322 INFO L229 MonitoredProcess]: Starting monitored process 64 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:15,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 03:35:15,324 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:15,335 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:15,335 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:15,335 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_3, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2022-02-21 03:35:15,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-02-21 03:35:15,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:15,472 INFO L297 tatePredicateManager]: 19 out of 21 supporting invariants were superfluous and have been removed [2022-02-21 03:35:15,479 INFO L390 LassoCheck]: Loop: "call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1;" "assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset;" [2022-02-21 03:35:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:15,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1000#unseeded} is VALID [2022-02-21 03:35:15,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#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; {1000#unseeded} is VALID [2022-02-21 03:35:15,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#unseeded} assume !(main_~length1~0#1 < 1); {1000#unseeded} is VALID [2022-02-21 03:35:15,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#unseeded} assume !(main_~length2~0#1 < 1); {1000#unseeded} is VALID [2022-02-21 03:35:15,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {1000#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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {1141#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {1120#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:15,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {1121#(and (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {1172#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:15,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {1172#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {1172#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:15,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {1172#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {1123#(and (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:15,704 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:15,704 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:15,725 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:15,725 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:15,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,726 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:15,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 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:15,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 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 46 states and 58 transitions. Complement of second has 6 states. [2022-02-21 03:35:15,792 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:15,792 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:15,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:15,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:15,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:15,793 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:15,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:15,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:15,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:15,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2022-02-21 03:35:15,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:15,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:15,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:15,795 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:15,795 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:15,795 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:15,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:15,796 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:15,796 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 58 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:15,796 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:15,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:15,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,797 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:15,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:15,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:15,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,797 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:15,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,798 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:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:35:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,799 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 46 letters. Loop has 46 letters. [2022-02-21 03:35:15,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:35:15,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:35:15,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,799 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 28 letters. Loop has 28 letters. [2022-02-21 03:35:15,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:35:15,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:15,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,800 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:15,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:15,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:15,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,800 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:15,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:15,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:15,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,801 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:15,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:15,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:15,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,801 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:15,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:15,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:15,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,802 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:15,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:15,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:15,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,802 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:15,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:15,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:15,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,802 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:15,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:15,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:15,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,803 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:15,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:15,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,803 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:15,804 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:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:15,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:15,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,804 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:15,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1000#unseeded} is VALID [2022-02-21 03:35:15,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#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; {1000#unseeded} is VALID [2022-02-21 03:35:15,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#unseeded} assume !(main_~length1~0#1 < 1); {1000#unseeded} is VALID [2022-02-21 03:35:15,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#unseeded} assume !(main_~length2~0#1 < 1); {1000#unseeded} is VALID [2022-02-21 03:35:15,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {1000#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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:15,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {1252#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {1120#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:16,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {1121#(and (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {1283#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:16,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {1283#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {1283#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:16,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {1283#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {1123#(and (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:16,005 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:16,006 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:16,017 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:16,018 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:16,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,018 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:16,018 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 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:16,085 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 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 46 states and 58 transitions. Complement of second has 6 states. [2022-02-21 03:35:16,086 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:16,086 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:16,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:16,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:16,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:16,086 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:16,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:16,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:16,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:16,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2022-02-21 03:35:16,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:16,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:16,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:16,089 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:16,089 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:16,089 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:16,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:16,090 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:16,090 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 58 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:16,090 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:16,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,091 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:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,091 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:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,092 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:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:35:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,093 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 46 letters. Loop has 46 letters. [2022-02-21 03:35:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:35:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:35:16,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,094 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 28 letters. Loop has 28 letters. [2022-02-21 03:35:16,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:35:16,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:16,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,094 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:16,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:16,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:16,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,095 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:16,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:16,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,096 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:16,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:16,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,097 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:16,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:16,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,098 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:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,099 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:16,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:16,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,099 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:16,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:16,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:16,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,100 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:16,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:16,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,101 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:16,101 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:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:16,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,102 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:16,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:16,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:16,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1000#unseeded} is VALID [2022-02-21 03:35:16,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#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; {1000#unseeded} is VALID [2022-02-21 03:35:16,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#unseeded} assume !(main_~length1~0#1 < 1); {1000#unseeded} is VALID [2022-02-21 03:35:16,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#unseeded} assume !(main_~length2~0#1 < 1); {1000#unseeded} is VALID [2022-02-21 03:35:16,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {1000#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_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem207#1, cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset, cstrcspn_#t~mem208#1, cstrcspn_#t~mem209#1, cstrcspn_#t~short210#1, cstrcspn_#t~mem212#1, cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset, cstrcspn_#t~mem206#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:16,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:16,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:16,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:16,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:16,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:16,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:16,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:16,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post205#1.base, 1 + cstrcspn_#t~post205#1.offset;havoc cstrcspn_#t~post205#1.base, cstrcspn_#t~post205#1.offset; {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:16,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:16,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {1363#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} assume !!(0 != cstrcspn_#t~mem206#1);havoc cstrcspn_#t~mem206#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem207#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem207#1; {1120#(and unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:16,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:16,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:16,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {1121#(and (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} call cstrcspn_#t~mem208#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := 0 != cstrcspn_#t~mem208#1; {1394#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:16,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {1394#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} assume cstrcspn_#t~short210#1;call cstrcspn_#t~mem209#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short210#1 := cstrcspn_#t~mem209#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); {1394#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:16,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {1394#(and (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| (- 1)))) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} assume !!cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1;cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post211#1.base, 1 + cstrcspn_#t~post211#1.offset;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {1123#(and (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded) (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_cstrcspn_~s~0#1.base|))} is VALID [2022-02-21 03:35:16,291 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:16,292 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:16,304 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:16,305 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:16,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,305 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:16,305 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 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:16,370 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 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 45 states and 60 transitions. Complement of second has 5 states. [2022-02-21 03:35:16,370 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:16,370 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:16,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:16,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:16,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:16,371 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:16,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:16,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:16,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:16,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. [2022-02-21 03:35:16,373 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:16,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:16,374 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:16,374 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:16,374 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:16,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:16,375 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:16,375 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:16,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:16,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:16,375 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:16,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,376 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:16,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:16,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,376 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:16,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:16,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:35:16,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,377 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 45 letters. Loop has 45 letters. [2022-02-21 03:35:16,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:35:16,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:35:16,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,377 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 28 letters. Loop has 28 letters. [2022-02-21 03:35:16,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:35:16,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:16,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,382 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:16,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:16,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:16,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,383 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:16,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:16,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,384 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:16,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:16,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,384 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:16,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:16,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:16,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,384 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:16,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:16,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,385 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:16,386 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:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-21 03:35:16,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:16,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:16,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:35:16,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:16,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:16,392 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:16,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2022-02-21 03:35:16,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:16,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:16,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:16,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:16,393 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:16,393 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:16,393 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:16,393 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:35:16,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:16,393 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:16,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:16,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:35:16 BoogieIcfgContainer [2022-02-21 03:35:16,397 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:16,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:16,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:16,398 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:16,398 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:03" (3/4) ... [2022-02-21 03:35:16,400 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:16,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:16,401 INFO L158 Benchmark]: Toolchain (without parser) took 14057.71ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 59.9MB in the beginning and 119.1MB in the end (delta: -59.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-02-21 03:35:16,401 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 94.4MB. Free memory was 63.6MB in the beginning and 63.5MB in the end (delta: 24.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:16,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.13ms. Allocated memory is still 94.4MB. Free memory was 59.6MB in the beginning and 61.1MB in the end (delta: -1.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:35:16,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.26ms. Allocated memory is still 94.4MB. Free memory was 61.1MB in the beginning and 58.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:16,403 INFO L158 Benchmark]: Boogie Preprocessor took 39.81ms. Allocated memory is still 94.4MB. Free memory was 58.7MB in the beginning and 57.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:16,403 INFO L158 Benchmark]: RCFGBuilder took 402.26ms. Allocated memory is still 94.4MB. Free memory was 56.7MB in the beginning and 42.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:35:16,403 INFO L158 Benchmark]: BuchiAutomizer took 13180.25ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 41.6MB in the beginning and 119.1MB in the end (delta: -77.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:16,403 INFO L158 Benchmark]: Witness Printer took 2.19ms. Allocated memory is still 163.6MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:16,404 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.13ms. Allocated memory is still 94.4MB. Free memory was 63.6MB in the beginning and 63.5MB in the end (delta: 24.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.13ms. Allocated memory is still 94.4MB. Free memory was 59.6MB in the beginning and 61.1MB in the end (delta: -1.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.26ms. Allocated memory is still 94.4MB. Free memory was 61.1MB in the beginning and 58.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.81ms. Allocated memory is still 94.4MB. Free memory was 58.7MB in the beginning and 57.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 402.26ms. Allocated memory is still 94.4MB. Free memory was 56.7MB in the beginning and 42.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 13180.25ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 41.6MB in the beginning and 119.1MB in the end (delta: -77.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.19ms. Allocated memory is still 163.6MB. Free memory is still 119.1MB. There was no memory consumed. 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 -1 * s + unknown-#length-unknown[nondetString2] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString2] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 10.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 227 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 161 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 104 mSDtfsCounter, 161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital260 mio100 ax100 hnf100 lsp103 ukn72 mio100 lsp30 div155 bol100 ite100 ukn100 eq155 hnf96 smp77 dnf909 smp33 tf100 neg95 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 283ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 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:16,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:16,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE