./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.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_mixed_alloca.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 f2e994fbd4308fecf33fa0184f8cdc44b0ef95d4019fc8f460440561d10a29a6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:01,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:01,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:01,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:01,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:01,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:01,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:01,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:01,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:01,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:01,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:01,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:01,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:01,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:01,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:01,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:01,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:01,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:01,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:01,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:01,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:01,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:01,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:01,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:01,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:01,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:01,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:01,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:01,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:01,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:01,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:01,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:01,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:01,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:01,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:01,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:01,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:01,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:01,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:01,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:01,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:01,848 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,883 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:01,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:01,885 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:01,885 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:01,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:01,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:01,887 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:01,887 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:01,887 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:01,888 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:01,888 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:01,888 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:01,889 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:01,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:01,889 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:01,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:01,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:01,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:01,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:01,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:01,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:01,890 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:01,890 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:01,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:01,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:01,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:01,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:01,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:01,892 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:01,893 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 -> f2e994fbd4308fecf33fa0184f8cdc44b0ef95d4019fc8f460440561d10a29a6 [2022-02-21 03:35:02,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:02,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:02,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:02,191 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:02,191 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:02,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2022-02-21 03:35:02,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ff771e2/2026bcba53274e21be4866bc21d20f2f/FLAG3f8223557 [2022-02-21 03:35:02,717 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:02,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2022-02-21 03:35:02,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ff771e2/2026bcba53274e21be4866bc21d20f2f/FLAG3f8223557 [2022-02-21 03:35:03,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ff771e2/2026bcba53274e21be4866bc21d20f2f [2022-02-21 03:35:03,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:03,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:03,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:03,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:03,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:03,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:03" (1/1) ... [2022-02-21 03:35:03,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60026388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:03, skipping insertion in model container [2022-02-21 03:35:03,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:03" (1/1) ... [2022-02-21 03:35:03,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:03,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:03,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:03,366 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:03,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:03,478 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:03,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:03 WrapperNode [2022-02-21 03:35:03,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:03,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:03,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:03,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:03,486 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:03" (1/1) ... [2022-02-21 03:35:03,511 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:03" (1/1) ... [2022-02-21 03:35:03,532 INFO L137 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2022-02-21 03:35:03,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:03,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:03,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:03,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:03,540 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:03" (1/1) ... [2022-02-21 03:35:03,540 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:03" (1/1) ... [2022-02-21 03:35:03,542 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:03" (1/1) ... [2022-02-21 03:35:03,543 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:03" (1/1) ... [2022-02-21 03:35:03,559 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:03" (1/1) ... [2022-02-21 03:35:03,564 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:03" (1/1) ... [2022-02-21 03:35:03,565 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:03" (1/1) ... [2022-02-21 03:35:03,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:03,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:03,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:03,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:03,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:03" (1/1) ... [2022-02-21 03:35:03,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:03,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:03,641 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:03,650 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:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:35:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:03,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:03,776 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:03,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:04,100 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:04,105 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:04,105 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:35:04,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:04 BoogieIcfgContainer [2022-02-21 03:35:04,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:04,107 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:04,107 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:04,116 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:04,116 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:04,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:03" (1/3) ... [2022-02-21 03:35:04,118 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65cc66cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:04, skipping insertion in model container [2022-02-21 03:35:04,118 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:04,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:03" (2/3) ... [2022-02-21 03:35:04,118 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65cc66cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:04, skipping insertion in model container [2022-02-21 03:35:04,119 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:04,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:04" (3/3) ... [2022-02-21 03:35:04,121 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrcspn_mixed_alloca.i [2022-02-21 03:35:04,167 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:04,168 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:04,168 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:04,168 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:04,168 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:04,168 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:04,168 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:04,169 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:04,193 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:04,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:04,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:04,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:04,218 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:04,219 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:04,219 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:04,219 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:04,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:04,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:04,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:04,225 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:04,225 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:04,231 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#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_~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); 15#L382-2true assume !(main_~length2~0#1 < 1); 6#L385-1true call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; 10#L369-4true [2022-02-21 03:35:04,232 INFO L793 eck$LassoCheckResult]: Loop: 10#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; 8#L372-5true assume !true; 7#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; 11#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; 10#L369-4true [2022-02-21 03:35:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:35:04,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:04,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536407458] [2022-02-21 03:35:04,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:04,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:04,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:04,485 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:04,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2022-02-21 03:35:04,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:04,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595637071] [2022-02-21 03:35:04,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:04,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:04,557 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:04,558 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:04,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-21 03:35:04,559 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:04,559 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:04,559 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:04,561 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:04,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:04,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595637071] [2022-02-21 03:35:04,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595637071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:04,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:04,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:35:04,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289268425] [2022-02-21 03:35:04,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:04,570 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:04,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:04,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:35:04,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:35:04,603 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:04,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:04,637 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:35:04,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:35:04,638 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:04,646 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:04,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2022-02-21 03:35:04,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:04,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2022-02-21 03:35:04,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:35:04,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:35:04,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:35:04,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:04,662 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:35:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:35:04,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:04,682 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:04,682 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:04,684 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:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:04,690 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:04,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:04,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:04,693 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:04,693 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:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:04,696 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:04,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:04,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:04,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:04,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:04,697 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:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:35:04,699 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:04,700 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:04,700 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:04,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:04,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:04,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:04,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:04,704 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:04,704 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:04,705 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_~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.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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:04,705 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:04,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2022-02-21 03:35:04,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:04,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705244247] [2022-02-21 03:35:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:04,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:04,759 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:04,792 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2022-02-21 03:35:04,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:04,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162723758] [2022-02-21 03:35:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:04,823 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:04,841 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:04,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2022-02-21 03:35:04,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:04,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541558625] [2022-02-21 03:35:04,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:04,891 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:04,929 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:05,811 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:05,812 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:05,812 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:05,812 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:05,812 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:05,812 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:05,812 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:05,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:05,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration2_Lasso [2022-02-21 03:35:05,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:05,813 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:05,837 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,843 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,846 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,849 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,852 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,856 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,859 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,862 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,865 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,867 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,870 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:06,458 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:06,461 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:06,464 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:06,466 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:06,468 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:06,471 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:06,473 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,267 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:07,271 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:07,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,275 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:07,283 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:07,284 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:07,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:07,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:07,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:07,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:07,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,321 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:07,332 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:07,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:07,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:07,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:07,343 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:07,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,380 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:07,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,382 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:07,387 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:07,388 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:07,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:07,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:07,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:07,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,427 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:07,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,428 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:07,429 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:07,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:07,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:07,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:07,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,477 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:07,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,479 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:07,486 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:07,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:07,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:07,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:07,496 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:07,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:35:07,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,516 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:07,516 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:07,518 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:07,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:07,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:07,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:07,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,541 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:07,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,542 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:07,543 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:07,545 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:07,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:07,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:07,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,579 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:07,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,580 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:07,581 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:07,582 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:07,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:07,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:07,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:07,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:35:07,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,613 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:07,614 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:07,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:07,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:07,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:07,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:07,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,639 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:07,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,641 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:07,646 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:07,646 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:07,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:07,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:07,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:07,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,670 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:07,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,671 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:07,682 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:07,683 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:07,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:07,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:07,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:35:07,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,750 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:07,750 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:07,752 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:07,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:07,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:07,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:35:07,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,821 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:07,821 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:07,823 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:07,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:07,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:07,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,853 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:07,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,854 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:07,855 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:07,856 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:07,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:07,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:07,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:35:07,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,885 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:07,885 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:07,887 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:07,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:07,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:07,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:35:07,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,914 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:07,914 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:07,917 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:07,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:07,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:07,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:07,966 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:07,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:07,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:07,967 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:07,969 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:07,970 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:07,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:07,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:07,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:07,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:07,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:07,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:07,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:08,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:08,030 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:08,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:08,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:08,031 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:08,032 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:08,034 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,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:08,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:08,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:08,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:08,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:08,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:08,075 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:08,119 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:35:08,119 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:35:08,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:08,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:08,134 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:08,196 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:08,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:08,217 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:08,217 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:08,218 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215#1.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215#1.base)_1 Supporting invariants [] [2022-02-21 03:35:08,243 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:08,324 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2022-02-21 03:35:08,332 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:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:08,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:08,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:08,432 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:08,433 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_~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:08,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:08,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:08,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; {151#(and unseeded (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|))} is VALID [2022-02-21 03:35:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:08,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:08,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:08,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|))} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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:08,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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; {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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:08,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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; {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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:08,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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); {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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:08,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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; {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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:08,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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); {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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:08,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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; {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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:08,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|))) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~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; {154#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrcspn_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_#t~malloc215#1.base|)))) unseeded) (= |ULTIMATE.start_main_#t~malloc215#1.base| |ULTIMATE.start_cstrcspn_~sc1~0#1.base|))} is VALID [2022-02-21 03:35:08,590 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:08,591 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:08,602 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:08,603 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:08,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,605 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:08,606 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:08,673 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:08,673 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:08,673 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:08,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:08,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:08,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:08,674 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:08,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:08,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:08,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:08,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:35:08,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:08,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:08,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:08,679 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:08,681 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:35:08,681 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:08,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:08,683 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:08,683 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:08,683 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:08,683 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:08,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,684 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:08,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,684 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:08,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,685 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:08,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,685 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:08,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,685 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:08,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,685 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:08,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,686 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:08,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,686 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:08,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,686 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:08,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,687 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:08,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,687 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:08,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,687 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:08,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,688 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:08,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,688 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:08,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,688 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:08,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,688 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:08,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,689 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:08,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,689 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:08,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,689 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:08,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,690 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:08,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,690 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:08,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,691 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:08,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,691 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:08,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,691 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:08,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,692 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:08,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,692 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:08,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,692 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:08,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,693 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:08,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,693 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:08,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,693 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:08,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,694 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:08,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,694 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:08,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,694 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:08,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,695 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:08,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,695 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:08,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,695 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:08,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,696 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:08,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,696 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:08,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,696 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:08,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,697 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:08,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,697 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:08,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,697 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:08,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,698 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:08,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,698 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:08,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,698 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:08,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,698 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:08,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,699 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:08,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,699 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:08,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,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 8 letters. Loop has 3 letters. [2022-02-21 03:35:08,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,700 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:08,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,700 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:08,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,700 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:08,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,700 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:08,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,701 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:08,702 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:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:35:08,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:08,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:35:08,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:08,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:08,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:08,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:08,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2022-02-21 03:35:08,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:35:08,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:35:08,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 03:35:08,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:08,706 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 03:35:08,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:35:08,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:08,707 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:08,707 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:08,708 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:08,708 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:08,710 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:08,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:08,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:08,711 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:08,711 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:08,711 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:08,712 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:08,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:08,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:08,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:08,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:08,713 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:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 03:35:08,714 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:08,714 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:08,714 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:08,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:08,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:08,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:08,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:08,715 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:08,715 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:08,716 INFO L791 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 223#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_~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; 232#L382 assume !(main_~length1~0#1 < 1); 239#L382-2 assume !(main_~length2~0#1 < 1); 224#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; 225#L369-4 call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 234#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; 228#L372-5 [2022-02-21 03:35:08,716 INFO L793 eck$LassoCheckResult]: Loop: 228#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; 229#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); 237#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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; 228#L372-5 [2022-02-21 03:35:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2022-02-21 03:35:08,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:08,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416969670] [2022-02-21 03:35:08,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:08,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:08,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:08,752 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:08,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2022-02-21 03:35:08,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:08,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154317823] [2022-02-21 03:35:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:08,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:08,799 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:08,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2022-02-21 03:35:08,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:08,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597305009] [2022-02-21 03:35:08,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:08,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:08,815 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:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:08,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:08,855 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:09,564 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:09,564 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:09,564 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:09,564 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:09,564 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:09,564 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:09,565 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:09,565 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:09,565 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration3_Lasso [2022-02-21 03:35:09,565 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:09,565 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:09,568 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:09,571 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:09,574 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:09,576 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:09,579 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:09,582 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:09,586 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:09,589 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:09,591 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:09,594 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:09,596 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:10,103 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:10,106 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:10,108 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:10,110 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:10,112 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:10,115 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:10,117 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:10,865 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:10,865 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:10,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:10,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:10,867 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:10,875 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:10,876 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:10,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:10,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:10,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:10,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:10,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:10,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:10,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:10,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:10,932 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:10,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:10,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:10,933 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:10,933 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:10,935 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:10,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:10,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:10,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:10,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:10,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:10,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:10,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:10,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:10,960 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:10,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:10,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:10,961 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:10,962 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:10,964 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:10,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:10,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:10,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:10,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:10,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:10,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:10,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,004 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:11,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,006 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:11,007 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:11,008 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:11,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:11,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:11,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:11,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:35:11,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,047 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:11,048 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:11,050 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:11,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:11,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:11,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:11,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:11,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,076 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:11,077 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:11,080 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:11,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:11,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:11,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:11,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,102 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:11,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,104 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:11,105 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:11,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:11,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:11,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:11,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:11,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,150 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:11,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,152 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:11,156 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:11,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:11,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:11,169 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:11,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,200 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:11,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,202 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:11,203 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:11,205 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:11,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:11,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:11,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:11,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,226 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:11,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,228 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:11,228 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:11,230 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:11,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:11,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:11,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:11,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:35:11,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,263 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:11,264 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:11,265 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:11,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:11,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:11,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:35:11,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,341 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:11,343 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:11,344 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:11,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:11,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:11,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:11,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,400 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:11,401 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:11,402 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:11,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:11,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:11,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,427 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:11,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,429 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:11,429 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:11,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:11,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:11,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:11,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:35:11,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,459 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:11,464 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:11,464 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:11,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:11,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:11,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:11,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 03:35:11,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,514 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:11,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:11,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:11,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:11,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:11,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:11,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:11,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:11,562 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:11,575 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:11,622 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2022-02-21 03:35:11,622 INFO L444 ModelExtractionUtils]: 23 out of 46 variables were initially zero. Simplification set additionally 20 variables to zero. [2022-02-21 03:35:11,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:11,628 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:11,629 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:11,630 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:11,664 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:11,664 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:11,664 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1 + 2*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2022-02-21 03:35:11,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:11,762 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2022-02-21 03:35:11,769 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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset;" [2022-02-21 03:35:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:11,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:11,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:11,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {329#unseeded} is VALID [2022-02-21 03:35:11,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#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_~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; {329#unseeded} is VALID [2022-02-21 03:35:11,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {329#unseeded} assume !(main_~length1~0#1 < 1); {329#unseeded} is VALID [2022-02-21 03:35:11,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {329#unseeded} assume !(main_~length2~0#1 < 1); {329#unseeded} is VALID [2022-02-21 03:35:11,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; {450#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:11,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {450#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) 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); {450#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) unseeded (= |ULTIMATE.start_cstrcspn_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} is VALID [2022-02-21 03:35:11,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {450#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) 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; {429#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) unseeded (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:11,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:35:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:11,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:11,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (>= oldRank0 (+ (* 2 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#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; {457#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:11,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#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); {457#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:11,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (<= (+ |ULTIMATE.start_cstrcspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcspn_~s~0#1.base|)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {432#(and (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded) (= |ULTIMATE.start_cstrcspn_~s~0#1.base| |ULTIMATE.start_main_#t~malloc216#1.base|))} is VALID [2022-02-21 03:35:11,952 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:11,953 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:11,963 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:11,963 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:11,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:11,964 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:11,964 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:12,038 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:12,039 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:12,039 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:12,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:12,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:12,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:12,039 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:12,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:12,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:12,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:12,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2022-02-21 03:35:12,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:12,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:12,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:12,048 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:12,049 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:12,049 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:12,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:12,050 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:12,050 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:12,052 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:12,052 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:12,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,053 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:12,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,053 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:12,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,054 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:12,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,054 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:12,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,055 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:12,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,055 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:12,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,055 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:12,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,055 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:12,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,056 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:12,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,056 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:12,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,056 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:12,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,056 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:12,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,057 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:12,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,057 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:12,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,057 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:12,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,057 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:12,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,058 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:12,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,058 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:12,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,058 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:12,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,059 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:12,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,059 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:12,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,059 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:12,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,060 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:12,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,060 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:12,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,061 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:12,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,061 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:12,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,062 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:12,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,062 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:12,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,062 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:12,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,062 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:12,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,063 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:12,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,064 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:12,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,064 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:12,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,064 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:12,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,064 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:12,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,065 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:12,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,066 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:12,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,066 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:12,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,067 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:12,068 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:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:12,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:12,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:12,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:35:12,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:12,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:12,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:12,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2022-02-21 03:35:12,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:35:12,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:12,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2022-02-21 03:35:12,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:12,073 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-21 03:35:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2022-02-21 03:35:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-02-21 03:35:12,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:12,074 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:12,075 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:12,075 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:12,075 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:12,076 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:12,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:12,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:12,077 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:12,077 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:12,077 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:12,078 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:12,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:12,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:12,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:12,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:12,079 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:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-02-21 03:35:12,080 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:12,080 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:12,080 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:35:12,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2022-02-21 03:35:12,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:12,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:12,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:12,081 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:12,081 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:12,081 INFO L791 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 518#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_~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; 527#L382 assume !(main_~length1~0#1 < 1); 536#L382-2 assume !(main_~length2~0#1 < 1); 519#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; 520#L369-4 call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 528#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; 537#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; 534#L372-1 assume !cstrcspn_#t~short210#1; 535#L372-3 assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; 521#L372-6 call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 522#L374 assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; 532#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; 529#L369-4 call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 531#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; 523#L372-5 [2022-02-21 03:35:12,083 INFO L793 eck$LassoCheckResult]: Loop: 523#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; 524#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); 533#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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; 523#L372-5 [2022-02-21 03:35:12,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2022-02-21 03:35:12,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:12,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156437090] [2022-02-21 03:35:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:12,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:12,132 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:12,154 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:12,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:12,154 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2022-02-21 03:35:12,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:12,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741406774] [2022-02-21 03:35:12,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:12,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:12,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:12,169 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:12,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2022-02-21 03:35:12,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:12,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398440058] [2022-02-21 03:35:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:12,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {669#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {669#true} is VALID [2022-02-21 03:35:12,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#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_~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; {669#true} is VALID [2022-02-21 03:35:12,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume !(main_~length1~0#1 < 1); {669#true} is VALID [2022-02-21 03:35:12,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {669#true} assume !(main_~length2~0#1 < 1); {669#true} is VALID [2022-02-21 03:35:12,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {669#true} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; {669#true} is VALID [2022-02-21 03:35:12,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {669#true} is VALID [2022-02-21 03:35:12,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {669#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; {671#(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:12,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#(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; {672#(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:12,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {672#(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; {673#(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:12,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {673#(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; {673#(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:12,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {673#(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); {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#(= (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; {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#(= (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; {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#(= (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); {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {674#(= (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#(= (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:12,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#(= (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; {676#(not |ULTIMATE.start_cstrcspn_#t~short210#1|)} is VALID [2022-02-21 03:35:12,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {676#(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); {670#false} is VALID [2022-02-21 03:35:12,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {670#false} is VALID [2022-02-21 03:35:12,302 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:12,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:12,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398440058] [2022-02-21 03:35:12,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398440058] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:12,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488575605] [2022-02-21 03:35:12,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:12,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:12,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:12,307 INFO L229 MonitoredProcess]: Starting monitored process 38 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:12,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-02-21 03:35:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:12,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-21 03:35:12,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:12,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:12,455 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 03:35:12,455 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:12,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {669#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {669#true} is VALID [2022-02-21 03:35:12,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#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_~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; {669#true} is VALID [2022-02-21 03:35:12,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume !(main_~length1~0#1 < 1); {669#true} is VALID [2022-02-21 03:35:12,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {669#true} assume !(main_~length2~0#1 < 1); {669#true} is VALID [2022-02-21 03:35:12,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {669#true} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; {669#true} is VALID [2022-02-21 03:35:12,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {669#true} is VALID [2022-02-21 03:35:12,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {669#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; {671#(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:12,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#(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; {701#(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:12,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {701#(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; {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#(= (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; {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {674#(= (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); {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#(= (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; {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#(= (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; {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#(= (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); {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {674#(= (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#(= (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:12,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#(= (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; {676#(not |ULTIMATE.start_cstrcspn_#t~short210#1|)} is VALID [2022-02-21 03:35:12,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {676#(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); {670#false} is VALID [2022-02-21 03:35:12,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {670#false} is VALID [2022-02-21 03:35:12,568 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:12,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:12,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {670#false} is VALID [2022-02-21 03:35:12,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {676#(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); {670#false} is VALID [2022-02-21 03:35:12,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#(= (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; {676#(not |ULTIMATE.start_cstrcspn_#t~short210#1|)} is VALID [2022-02-21 03:35:12,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {674#(= (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#(= (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:12,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#(= (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); {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#(= (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; {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#(= (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; {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {674#(= (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); {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#(= (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; {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {759#(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; {674#(= (select (select |#memory_int| |ULTIMATE.start_cstrcspn_~s2#1.base|) |ULTIMATE.start_cstrcspn_~s2#1.offset|) 0)} is VALID [2022-02-21 03:35:12,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {763#(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; {759#(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:12,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {669#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; {763#(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:12,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {669#true} is VALID [2022-02-21 03:35:12,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {669#true} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; {669#true} is VALID [2022-02-21 03:35:12,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {669#true} assume !(main_~length2~0#1 < 1); {669#true} is VALID [2022-02-21 03:35:12,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume !(main_~length1~0#1 < 1); {669#true} is VALID [2022-02-21 03:35:12,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#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_~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; {669#true} is VALID [2022-02-21 03:35:12,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {669#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {669#true} is VALID [2022-02-21 03:35:12,652 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:12,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488575605] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:12,652 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:12,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2022-02-21 03:35:12,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756662927] [2022-02-21 03:35:12,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:12,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:12,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:35:12,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:35:12,756 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:13,047 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-02-21 03:35:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:35:13,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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:13,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:13,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2022-02-21 03:35:13,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:13,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2022-02-21 03:35:13,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:35:13,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:35:13,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2022-02-21 03:35:13,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:13,073 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-02-21 03:35:13,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2022-02-21 03:35:13,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2022-02-21 03:35:13,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:13,076 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:13,076 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:13,076 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:13,077 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:13,078 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-21 03:35:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-21 03:35:13,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:13,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:13,079 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:13,079 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:13,079 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:13,089 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-21 03:35:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-21 03:35:13,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:13,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:13,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:13,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:13,092 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:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-21 03:35:13,092 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-21 03:35:13,093 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-21 03:35:13,093 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:35:13,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2022-02-21 03:35:13,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:13,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:13,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:13,094 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:13,094 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:13,094 INFO L791 eck$LassoCheckResult]: Stem: 845#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 846#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_~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; 855#L382 assume !(main_~length1~0#1 < 1); 864#L382-2 assume !(main_~length2~0#1 < 1); 847#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; 848#L369-4 call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 856#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; 869#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; 862#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); 863#L372-3 assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; 849#L372-6 call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 850#L374 assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; 860#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; 857#L369-4 call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 859#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; 851#L372-5 [2022-02-21 03:35:13,094 INFO L793 eck$LassoCheckResult]: Loop: 851#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; 852#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); 861#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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; 851#L372-5 [2022-02-21 03:35:13,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2022-02-21 03:35:13,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:13,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492936571] [2022-02-21 03:35:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,138 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:13,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2022-02-21 03:35:13,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:13,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11703532] [2022-02-21 03:35:13,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,144 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,147 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:13,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:13,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2022-02-21 03:35:13,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:13,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851986088] [2022-02-21 03:35:13,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,192 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,216 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:14,221 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:14,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:14,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:14,221 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:14,221 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:14,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:14,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:14,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca.i_Iteration5_Lasso [2022-02-21 03:35:14,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:14,222 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:14,225 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,227 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,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:14,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:14,234 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,236 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,238 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,240 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,241 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,245 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,247 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,249 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,250 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,252 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,254 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,255 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,258 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,259 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:16,199 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:16,200 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:16,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,202 INFO L229 MonitoredProcess]: Starting monitored process 39 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:16,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:35:16,249 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:16,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:16,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,295 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:16,298 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:16,298 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:16,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:16,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,322 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:16,328 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:16,329 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:16,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:16,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:16,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,353 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:16,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,354 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:16,355 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:16,404 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:16,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,429 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:16,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,430 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:16,431 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:16,433 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:16,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,459 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:16,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,460 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:16,461 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:16,463 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:16,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,520 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:16,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,522 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:16,522 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:16,524 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:16,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:16,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,571 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:16,572 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:16,573 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:16,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,597 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:16,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,598 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:16,604 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:16,605 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:16,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:16,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:16,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,630 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:16,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,631 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:16,632 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:16,633 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:16,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,657 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:16,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,658 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:16,658 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:16,660 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:16,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 03:35:16,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,685 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:16,687 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:16,688 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:16,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,712 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:16,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,714 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:16,714 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:16,744 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:16,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 03:35:16,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,779 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:16,780 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:16,781 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:16,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,805 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:16,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,807 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:16,808 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:16,809 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:16,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:16,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,833 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:16,834 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:16,835 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:16,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-02-21 03:35:16,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,887 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:16,896 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:16,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:16,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:16,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:16,906 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:16,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:16,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,943 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:16,944 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:16,945 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:16,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:16,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:16,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:16,978 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:16,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,980 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:16,980 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:16,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:16,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:16,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:16,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:16,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:16,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:16,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:16,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:17,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 03:35:17,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:17,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:17,008 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:17,008 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:17,010 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:17,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:17,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:17,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:17,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:17,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:17,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:17,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:17,068 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:35:17,068 INFO L444 ModelExtractionUtils]: 11 out of 52 variables were initially zero. Simplification set additionally 38 variables to zero. [2022-02-21 03:35:17,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:17,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:17,069 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:17,070 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:17,071 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:17,078 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:17,078 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:17,078 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset) = 2*ULTIMATE.start_cstrcspn_~s~0#1.offset + 1 Supporting invariants [] [2022-02-21 03:35:17,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:17,210 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:17,245 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2022-02-21 03:35:17,248 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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset;" [2022-02-21 03:35:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:17,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1042#unseeded} is VALID [2022-02-21 03:35:17,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#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_~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; {1042#unseeded} is VALID [2022-02-21 03:35:17,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#unseeded} assume !(main_~length1~0#1 < 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {1042#unseeded} assume !(main_~length2~0#1 < 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {1042#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; {1042#unseeded} is VALID [2022-02-21 03:35:17,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#unseeded} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#unseeded} 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); {1042#unseeded} is VALID [2022-02-21 03:35:17,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#unseeded} assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; {1042#unseeded} is VALID [2022-02-21 03:35:17,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {1042#unseeded} call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {1042#unseeded} assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; {1042#unseeded} is VALID [2022-02-21 03:35:17,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#unseeded} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:35:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:17,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {1045#(>= oldRank0 (+ (* 2 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 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; {1232#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} is VALID [2022-02-21 03:35:17,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {1232#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} 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); {1232#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} is VALID [2022-02-21 03:35:17,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {1232#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} 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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {1185#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 1))))} is VALID [2022-02-21 03:35:17,367 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:17,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,375 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:17,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,376 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:17,376 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,418 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 5 states. [2022-02-21 03:35:17,418 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:17,419 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:17,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:17,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:17,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:17,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:17,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:17,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:17,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2022-02-21 03:35:17,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:17,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:17,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:17,422 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:17,423 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:17,423 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:17,427 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:17,427 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 58 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:17,428 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:17,428 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:17,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,428 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:17,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,429 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:17,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,429 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:17,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,430 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:17,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,430 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:17,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,430 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:17,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,431 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:17,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:17,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 3 letters. Loop has 3 letters. [2022-02-21 03:35:17,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:17,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,431 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:17,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,431 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:17,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,432 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:17,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,432 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:17,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,432 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:17,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,433 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:17,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,433 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:17,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,434 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:17,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,434 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:17,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,434 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:17,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,434 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:17,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,434 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:17,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,435 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 03:35:17,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:17,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,436 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:17,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1042#unseeded} is VALID [2022-02-21 03:35:17,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#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_~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; {1042#unseeded} is VALID [2022-02-21 03:35:17,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#unseeded} assume !(main_~length1~0#1 < 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {1042#unseeded} assume !(main_~length2~0#1 < 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {1042#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; {1042#unseeded} is VALID [2022-02-21 03:35:17,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#unseeded} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#unseeded} 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); {1042#unseeded} is VALID [2022-02-21 03:35:17,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#unseeded} assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; {1042#unseeded} is VALID [2022-02-21 03:35:17,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {1042#unseeded} call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {1042#unseeded} assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; {1042#unseeded} is VALID [2022-02-21 03:35:17,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#unseeded} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:35:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:17,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {1045#(>= oldRank0 (+ (* 2 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 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; {1338#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} is VALID [2022-02-21 03:35:17,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {1338#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} 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); {1338#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} is VALID [2022-02-21 03:35:17,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {1338#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} 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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {1185#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 1))))} is VALID [2022-02-21 03:35:17,556 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:17,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,562 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:17,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,563 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:35:17,563 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,601 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 5 states. [2022-02-21 03:35:17,602 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:17,602 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:17,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:17,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:17,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:17,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:17,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:17,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:17,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2022-02-21 03:35:17,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:17,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:17,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:17,606 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:17,606 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:17,606 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:17,607 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:17,607 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 58 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:17,609 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:17,609 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:17,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,610 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:17,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,612 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:17,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,612 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:17,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,613 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:17,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,614 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:17,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,614 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:17,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,615 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:17,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:17,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 3 letters. Loop has 3 letters. [2022-02-21 03:35:17,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:17,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,616 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:17,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,617 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:17,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,617 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:17,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,617 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:17,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,618 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:17,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,619 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:17,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 58 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,620 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:17,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,620 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:17,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,620 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:17,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,621 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:17,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,621 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:17,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,622 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:17,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,622 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 03:35:17,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:17,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,625 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:17,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:17,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1042#unseeded} is VALID [2022-02-21 03:35:17,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#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_~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; {1042#unseeded} is VALID [2022-02-21 03:35:17,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#unseeded} assume !(main_~length1~0#1 < 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {1042#unseeded} assume !(main_~length2~0#1 < 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {1042#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := 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, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#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; {1042#unseeded} is VALID [2022-02-21 03:35:17,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#unseeded} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#unseeded} 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); {1042#unseeded} is VALID [2022-02-21 03:35:17,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#unseeded} assume !cstrcspn_#t~short210#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~mem209#1;havoc cstrcspn_#t~short210#1; {1042#unseeded} is VALID [2022-02-21 03:35:17,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {1042#unseeded} call cstrcspn_#t~mem212#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {1042#unseeded} assume !(cstrcspn_#t~mem212#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem212#1; {1042#unseeded} is VALID [2022-02-21 03:35:17,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#unseeded} call cstrcspn_#t~mem206#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); {1042#unseeded} is VALID [2022-02-21 03:35:17,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#unseeded} 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; {1042#unseeded} is VALID [2022-02-21 03:35:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:35:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:17,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:17,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {1045#(>= oldRank0 (+ (* 2 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 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; {1444#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} is VALID [2022-02-21 03:35:17,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} 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); {1444#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} is VALID [2022-02-21 03:35:17,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {1444#(and (>= oldRank0 (+ (* |ULTIMATE.start_cstrcspn_~s~0#1.offset| 2) 1)) (<= 0 |ULTIMATE.start_cstrcspn_~s~0#1.offset|))} 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, cstrcspn_#t~post211#1.offset - 1;havoc cstrcspn_#t~post211#1.base, cstrcspn_#t~post211#1.offset; {1185#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_cstrcspn_~s~0#1.offset|) 1))))} is VALID [2022-02-21 03:35:17,750 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:17,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,756 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:17,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,757 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:35:17,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,798 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 4 states. [2022-02-21 03:35:17,798 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:17,798 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:17,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:17,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:17,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:17,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:17,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:17,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:17,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. [2022-02-21 03:35:17,799 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:17,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:17,800 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:17,800 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:17,800 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:17,801 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:17,801 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:17,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:17,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:17,801 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:17,801 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:17,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,801 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:17,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,802 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:17,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,802 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:17,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,802 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:17,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,803 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:17,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:17,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 3 letters. Loop has 3 letters. [2022-02-21 03:35:17,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:17,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,804 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:17,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,804 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:17,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,804 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:17,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,804 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:17,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,805 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:17,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,805 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:17,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 60 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:17,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,808 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-21 03:35:17,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:17,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:17,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:35:17,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:17,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:17,812 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:17,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2022-02-21 03:35:17,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:17,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:17,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:17,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:17,813 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:17,813 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:17,813 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:17,813 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:35:17,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:17,813 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:17,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:17,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:35:17 BoogieIcfgContainer [2022-02-21 03:35:17,818 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:17,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:17,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:17,819 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:17,820 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:04" (3/4) ... [2022-02-21 03:35:17,822 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:17,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:17,823 INFO L158 Benchmark]: Toolchain (without parser) took 14757.65ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 69.7MB in the beginning and 56.6MB in the end (delta: 13.1MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2022-02-21 03:35:17,823 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:17,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.07ms. Allocated memory is still 107.0MB. Free memory was 69.5MB in the beginning and 73.1MB in the end (delta: -3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:35:17,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.97ms. Allocated memory is still 107.0MB. Free memory was 73.1MB in the beginning and 70.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:17,824 INFO L158 Benchmark]: Boogie Preprocessor took 40.05ms. Allocated memory is still 107.0MB. Free memory was 70.7MB in the beginning and 68.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:17,824 INFO L158 Benchmark]: RCFGBuilder took 532.98ms. Allocated memory is still 107.0MB. Free memory was 68.6MB in the beginning and 53.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:35:17,825 INFO L158 Benchmark]: BuchiAutomizer took 13711.11ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 53.6MB in the beginning and 56.6MB in the end (delta: -3.0MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2022-02-21 03:35:17,825 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 157.3MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:17,826 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.17ms. Allocated memory is still 107.0MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.07ms. Allocated memory is still 107.0MB. Free memory was 69.5MB in the beginning and 73.1MB in the end (delta: -3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.97ms. Allocated memory is still 107.0MB. Free memory was 73.1MB in the beginning and 70.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.05ms. Allocated memory is still 107.0MB. Free memory was 70.7MB in the beginning and 68.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 532.98ms. Allocated memory is still 107.0MB. Free memory was 68.6MB in the beginning and 53.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 13711.11ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 53.6MB in the beginning and 56.6MB in the end (delta: -3.0MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 157.3MB. Free memory is still 56.6MB. 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[__builtin_alloca(length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function 2 * s + unknown-#length-unknown[nondetString2] and consists of 4 locations. One nondeterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.8s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. 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, 125 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 114 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital271 mio100 ax100 hnf100 lsp103 ukn76 mio100 lsp39 div116 bol100 ite100 ukn100 eq180 hnf92 smp90 dnf709 smp29 tf100 neg93 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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:17,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-02-21 03:35:18,044 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