./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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-memory-alloca/cstrspn-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 739cfa6985f5cbe3c485b066571ccf0bd5575c5b24975a1e4ae9d10696731379 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:26,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:26,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:26,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:26,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:26,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:26,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:26,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:26,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:26,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:26,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:26,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:26,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:26,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:26,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:26,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:26,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:26,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:26,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:26,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:26,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:26,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:26,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:26,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:26,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:26,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:26,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:26,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:26,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:26,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:26,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:26,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:26,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:26,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:26,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:26,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:26,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:26,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:26,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:26,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:26,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:26,913 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:32:26,953 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:26,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:26,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:26,968 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:26,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:26,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:26,969 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:26,969 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:26,969 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:26,970 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:26,970 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:26,970 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:26,971 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:26,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:26,971 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:26,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:26,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:26,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:26,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:26,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:26,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:26,972 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:26,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:26,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:26,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:26,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:26,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:26,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:26,973 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:26,973 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 -> 739cfa6985f5cbe3c485b066571ccf0bd5575c5b24975a1e4ae9d10696731379 [2022-02-21 03:32:27,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:27,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:27,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:27,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:27,265 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:27,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i [2022-02-21 03:32:27,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02aad3879/ea4ce7397ce44b2da1f8c0049e1cb907/FLAG66d8e3241 [2022-02-21 03:32:27,663 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:27,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i [2022-02-21 03:32:27,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02aad3879/ea4ce7397ce44b2da1f8c0049e1cb907/FLAG66d8e3241 [2022-02-21 03:32:27,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02aad3879/ea4ce7397ce44b2da1f8c0049e1cb907 [2022-02-21 03:32:27,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:27,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:27,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:27,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:27,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:27,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:27" (1/1) ... [2022-02-21 03:32:27,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3799638a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:27, skipping insertion in model container [2022-02-21 03:32:27,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:27" (1/1) ... [2022-02-21 03:32:27,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:27,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:27,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:27,952 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:27,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:28,012 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:28,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:28 WrapperNode [2022-02-21 03:32:28,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:28,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:28,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:28,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:28,020 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:32:28" (1/1) ... [2022-02-21 03:32:28,044 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:32:28" (1/1) ... [2022-02-21 03:32:28,072 INFO L137 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2022-02-21 03:32:28,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:28,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:28,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:28,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:28,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:28" (1/1) ... [2022-02-21 03:32:28,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:28" (1/1) ... [2022-02-21 03:32:28,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:28" (1/1) ... [2022-02-21 03:32:28,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:28" (1/1) ... [2022-02-21 03:32:28,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:28" (1/1) ... [2022-02-21 03:32:28,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:28" (1/1) ... [2022-02-21 03:32:28,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:28" (1/1) ... [2022-02-21 03:32:28,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:28,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:28,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:28,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:28,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:28" (1/1) ... [2022-02-21 03:32:28,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:28,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:28,145 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:32:28,152 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:32:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:28,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:28,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:28,305 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:28,306 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:28,636 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:28,640 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:28,641 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:32:28,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:28 BoogieIcfgContainer [2022-02-21 03:32:28,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:28,653 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:28,653 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:28,655 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:28,656 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:28,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:27" (1/3) ... [2022-02-21 03:32:28,656 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c37bf97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:28, skipping insertion in model container [2022-02-21 03:32:28,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:28,657 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:28" (2/3) ... [2022-02-21 03:32:28,657 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c37bf97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:28, skipping insertion in model container [2022-02-21 03:32:28,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:28,657 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:28" (3/3) ... [2022-02-21 03:32:28,658 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca-2.i [2022-02-21 03:32:28,730 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:28,730 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:28,730 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:28,730 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:28,730 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:28,730 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:28,731 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:28,731 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:28,750 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:32:28,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:32:28,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:28,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:28,787 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:28,787 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:28,787 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:28,788 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:32:28,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:32:28,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:28,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:28,796 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:28,796 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:32:28,820 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; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 4#L565true assume !(main_~length1~0#1 < 1); 13#L565-2true assume !(main_~length2~0#1 < 1); 18#L568-1true call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 7#L552-4true [2022-02-21 03:32:28,821 INFO L793 eck$LassoCheckResult]: Loop: 7#L552-4true call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 12#L552-1true assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 11#L555-5true assume !true; 14#L555-6true call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 17#L557true assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 6#L552-3true cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 7#L552-4true [2022-02-21 03:32:28,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:28,843 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:32:28,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:28,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450265694] [2022-02-21 03:32:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:28,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:29,070 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:29,147 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:29,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2022-02-21 03:32:29,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:29,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939605390] [2022-02-21 03:32:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:29,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:29,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {24#true} is VALID [2022-02-21 03:32:29,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {24#true} is VALID [2022-02-21 03:32:29,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-21 03:32:29,268 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {25#false} is VALID [2022-02-21 03:32:29,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {25#false} is VALID [2022-02-21 03:32:29,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {25#false} is VALID [2022-02-21 03:32:29,269 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:32:29,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:29,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939605390] [2022-02-21 03:32:29,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939605390] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:29,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:29,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:32:29,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972054538] [2022-02-21 03:32:29,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:29,273 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:32:29,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:29,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:32:29,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:32:29,314 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:32:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:29,372 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:32:29,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:32:29,374 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:32:29,380 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:32:29,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2022-02-21 03:32:29,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:32:29,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2022-02-21 03:32:29,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:32:29,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:32:29,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:32:29,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:29,395 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:32:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:32:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:32:29,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:29,425 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:32:29,425 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:32:29,426 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:32:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:29,435 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:32:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:32:29,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:29,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:29,436 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:32:29,437 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:32:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:29,438 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:32:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:32:29,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:29,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:29,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:29,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:29,439 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:32:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:32:29,440 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:32:29,440 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:32:29,440 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:29,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:32:29,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:32:29,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:29,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:29,445 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:29,445 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:29,446 INFO L791 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 49#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 44#L565 assume !(main_~length1~0#1 < 1); 45#L565-2 assume !(main_~length2~0#1 < 1); 56#L568-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 47#L552-4 [2022-02-21 03:32:29,446 INFO L793 eck$LassoCheckResult]: Loop: 47#L552-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 53#L552-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 52#L555-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 54#L555-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 50#L555-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 51#L555-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 55#L557 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 46#L552-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 47#L552-4 [2022-02-21 03:32:29,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:29,447 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2022-02-21 03:32:29,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:29,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233508097] [2022-02-21 03:32:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:29,495 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:29,550 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:29,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:29,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2022-02-21 03:32:29,553 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:29,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145591123] [2022-02-21 03:32:29,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:29,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:29,603 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:29,633 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2022-02-21 03:32:29,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:29,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516356182] [2022-02-21 03:32:29,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:29,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:29,714 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:29,745 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:30,345 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:30,345 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:30,346 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:30,346 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:30,346 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:30,346 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:30,346 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:30,346 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:30,346 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration2_Lasso [2022-02-21 03:32:30,347 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:30,347 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:30,371 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:32:30,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:30,854 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:32:30,857 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:32:30,860 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:32:30,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:32:30,864 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:32:30,866 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:32:30,868 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:32:30,893 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:32:30,895 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:32:30,897 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:32:30,899 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:32:30,901 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:32:30,903 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:32:30,905 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:32:30,907 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:32:30,908 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:32:30,911 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:32:30,944 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:32:30,946 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:32:31,559 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:31,562 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:31,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:31,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:31,573 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:32:31,574 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:32:31,575 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:32:31,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:31,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:31,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:31,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:31,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:31,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:31,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:31,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:31,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:32:31,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:31,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:31,631 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:32:31,633 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:32:31,635 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:32:31,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:31,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:31,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:31,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:31,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:31,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:31,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:31,690 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:32:31,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:31,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:31,692 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:32:31,693 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:32:31,694 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:32:31,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:31,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:31,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:31,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:31,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:31,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:31,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:31,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:31,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:31,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:31,784 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:32:31,801 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:32:31,802 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:32:31,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:31,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:31,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:31,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:31,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:31,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:31,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:31,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:31,843 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:32:31,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:31,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:31,852 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:32:31,852 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:32:31,869 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:32:31,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:31,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:31,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:31,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:31,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:31,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:31,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:31,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:31,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:31,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:31,919 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:32:31,920 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:32:31,971 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:32:31,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:31,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:31,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:31,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:31,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:31,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:32,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:32,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:32:32,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:32,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:32,022 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:32:32,023 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:32:32,024 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:32:32,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:32,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:32,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:32,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:32,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:32,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:32,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:32,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:32:32,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:32,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:32,064 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:32:32,065 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:32:32,068 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:32:32,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:32,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:32,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:32,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:32,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:32,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:32,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:32,149 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:32:32,149 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:32:32,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:32,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:32,151 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:32:32,164 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:32,172 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:32:32,180 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:32,180 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:32,181 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0#1.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0#1.base)_1 Supporting invariants [] [2022-02-21 03:32:32,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:32,266 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-02-21 03:32:32,275 INFO L390 LassoCheck]: Loop: "call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);" "assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1;" "call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1;" "assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;" "call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);" "assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1;" "cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset;" [2022-02-21 03:32:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:32,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:32,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:32,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:32,357 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:32:32,358 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~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {92#unseeded} is VALID [2022-02-21 03:32:32,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:32:32,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:32:32,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {92#unseeded} is VALID [2022-02-21 03:32:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:32,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:32:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:32,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:32,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {95#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|)))} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:32:32,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:32:32,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:32:32,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:32:32,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:32:32,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:32:32,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} is VALID [2022-02-21 03:32:32,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|)))} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {150#(or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|)))) unseeded)} is VALID [2022-02-21 03:32:32,475 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:32:32,477 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:32:32,484 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:32:32,486 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:32:32,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,487 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:32:32,488 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:32:32,542 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:32:32,542 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:32:32,543 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:32,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:32:32,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:32,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:32,544 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:32:32,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:32,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:32,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:32,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:32:32,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:32,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:32,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:32,551 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:32:32,555 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:32:32,556 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:32:32,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:32,558 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:32,558 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:32,559 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:32,559 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:32:32,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,560 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:32:32,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,561 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:32:32,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,561 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:32:32,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,562 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:32:32,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,562 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:32:32,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,562 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:32:32,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,562 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:32:32,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,563 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:32:32,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,563 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:32:32,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,564 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:32:32,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,565 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:32:32,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,565 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:32:32,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,565 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:32:32,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,566 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:32:32,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,566 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:32:32,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,566 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:32:32,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,566 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:32:32,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,567 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:32:32,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,567 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:32:32,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,567 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:32:32,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,567 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:32:32,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,568 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:32:32,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,568 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:32:32,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,568 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:32:32,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,569 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:32:32,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,569 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:32:32,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,569 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:32:32,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,570 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:32:32,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,570 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:32:32,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,570 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:32:32,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,570 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:32:32,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,571 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:32:32,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,571 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:32:32,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,571 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:32:32,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,572 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:32:32,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,572 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:32:32,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,572 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:32:32,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,573 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:32:32,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,573 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:32:32,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,573 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:32:32,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,573 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:32:32,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,574 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:32:32,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,574 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:32:32,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,574 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:32:32,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,575 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:32:32,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,575 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:32:32,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,575 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:32:32,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,575 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:32:32,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,576 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:32:32,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,576 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:32:32,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,576 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:32:32,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,576 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:32:32,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,577 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:32:32,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,577 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:32,578 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:32:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:32:32,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:32:32,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:32:32,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:32:32,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:32,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:32,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:32,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2022-02-21 03:32:32,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:32:32,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:32:32,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 03:32:32,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:32,581 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:32:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 03:32:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:32:32,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:32,582 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:32:32,582 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:32:32,583 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:32:32,583 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:32,585 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:32:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:32:32,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:32,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:32,585 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:32:32,586 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:32:32,586 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:32,587 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:32:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:32:32,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:32,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:32,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:32,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:32,588 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:32:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 03:32:32,588 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:32:32,588 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:32:32,589 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:32,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:32:32,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:32,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:32,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:32,591 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:32,591 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:32,591 INFO L791 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 216#L565 assume !(main_~length1~0#1 < 1); 217#L565-2 assume !(main_~length2~0#1 < 1); 233#L568-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 222#L552-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 224#L552-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 226#L555-5 [2022-02-21 03:32:32,591 INFO L793 eck$LassoCheckResult]: Loop: 226#L555-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 230#L555-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 225#L555-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 226#L555-5 [2022-02-21 03:32:32,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:32,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2022-02-21 03:32:32,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:32,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324690961] [2022-02-21 03:32:32,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:32,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:32,611 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:32,622 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2022-02-21 03:32:32,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:32,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000145743] [2022-02-21 03:32:32,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:32,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:32,633 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:32,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2022-02-21 03:32:32,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:32,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195982235] [2022-02-21 03:32:32,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:32,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:32,653 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:32,666 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:32,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:32:33,253 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:33,253 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:33,254 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:33,254 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:33,254 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:33,254 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:33,254 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:33,254 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:33,254 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration3_Lasso [2022-02-21 03:32:33,254 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:33,254 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:33,256 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:32:33,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:32:33,260 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:32:33,263 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:32:33,264 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:32:33,266 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:32:33,269 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:32:33,270 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:32:33,272 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:32:33,275 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:32:33,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,278 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:32:33,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:33,683 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:32:33,685 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:32:33,687 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:32:33,689 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:32:33,691 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:32:33,693 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:32:33,695 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:32:33,697 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:32:33,698 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:32:34,303 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:34,303 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:34,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,307 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:32:34,307 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:32:34,308 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:32:34,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:34,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:34,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:34,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,344 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:32:34,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,345 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:32:34,349 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:32:34,349 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:32:34,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:34,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:34,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:34,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,387 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:32:34,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,388 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:32:34,389 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:32:34,390 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:32:34,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,414 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:32:34,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,422 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:32:34,422 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:32:34,424 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:32:34,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:34,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:34,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:34,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,456 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:32:34,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,457 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:32:34,458 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:32:34,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:34,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:34,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:34,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:34,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:34,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,498 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:32:34,499 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:32:34,500 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:32:34,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:34,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,527 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:32:34,528 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:32:34,530 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:32:34,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:34,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:34,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:34,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,571 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:32:34,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,573 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:32:34,573 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:32:34,575 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:32:34,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:34,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:34,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:34,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,609 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:32:34,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,610 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:32:34,612 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:32:34,613 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:32:34,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,653 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:32:34,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,655 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:32:34,659 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:32:34,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:34,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:34,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:34,670 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:32:34,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 03:32:34,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,691 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:32:34,692 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:32:34,693 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:32:34,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:34,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:34,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:34,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:34,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,733 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:32:34,734 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:32:34,735 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:32:34,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:34,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:34,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:34,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:34,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,777 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:32:34,795 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:32:34,796 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:32:34,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,824 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:32:34,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,825 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:32:34,826 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:32:34,827 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:32:34,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:34,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,893 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:32:34,894 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:32:34,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:32:34,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:34,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:32:34,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,924 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:32:34,927 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:32:34,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:34,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:34,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:34,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:34,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:34,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:34,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:34,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:34,980 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 03:32:34,980 INFO L444 ModelExtractionUtils]: 13 out of 49 variables were initially zero. Simplification set additionally 33 variables to zero. [2022-02-21 03:32:34,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:34,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:34,996 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:32:35,010 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:32:35,010 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:35,020 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:35,020 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:35,020 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2, ULTIMATE.start_cstrspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0#1.offset Supporting invariants [] [2022-02-21 03:32:35,037 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:32:35,120 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2022-02-21 03:32:35,125 INFO L390 LassoCheck]: Loop: "call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1;" "assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset;" [2022-02-21 03:32:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:35,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:35,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:32:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:35,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:35,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {323#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {323#unseeded} is VALID [2022-02-21 03:32:35,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {323#unseeded} is VALID [2022-02-21 03:32:35,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {323#unseeded} assume !(main_~length1~0#1 < 1); {323#unseeded} is VALID [2022-02-21 03:32:35,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {323#unseeded} assume !(main_~length2~0#1 < 1); {323#unseeded} is VALID [2022-02-21 03:32:35,212 INFO L290 TraceCheckUtils]: 4: Hoare triple {323#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {433#(and unseeded (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:35,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {433#(and unseeded (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {433#(and unseeded (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:35,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(and unseeded (= |ULTIMATE.start_cstrspn_~s2#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {412#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) unseeded)} is VALID [2022-02-21 03:32:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:35,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:32:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:35,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:35,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {413#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {440#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:32:35,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {440#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {440#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:32:35,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {440#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; {415#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))) (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|))} is VALID [2022-02-21 03:32:35,262 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:32:35,262 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:32:35,270 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:32:35,270 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:32:35,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,271 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:32:35,271 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:32:35,338 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:32:35,338 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:32:35,338 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:35,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:35,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:35,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:35,338 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:32:35,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:35,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:35,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:35,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2022-02-21 03:32:35,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:35,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:35,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:35,341 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:32:35,341 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:35,341 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:32:35,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:35,342 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:35,342 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:32:35,343 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:35,343 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:32:35,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,343 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:32:35,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,343 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:32:35,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,343 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:32:35,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,344 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:32:35,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,344 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:32:35,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,344 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:32:35,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,344 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:32:35,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,345 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:32:35,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,345 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:32:35,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,345 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:32:35,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,345 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:32:35,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,346 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:32:35,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,346 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:32:35,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,346 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:32:35,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,346 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:32:35,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,346 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:32:35,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,347 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:32:35,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,347 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:32:35,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,347 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:32:35,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,347 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:32:35,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,348 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:32:35,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,348 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:32:35,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,348 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:32:35,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,348 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:32:35,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,349 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:32:35,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,349 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:32:35,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,349 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:32:35,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,349 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:32:35,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,350 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:32:35,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,350 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:32:35,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,350 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:32:35,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,351 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:32:35,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,351 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:32:35,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,351 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:32:35,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,351 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:32:35,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,351 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:32:35,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,352 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:32:35,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,352 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:32:35,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,352 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:35,353 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:32:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:32:35,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:35,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:32:35,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:32:35,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:35,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:32:35,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:35,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2022-02-21 03:32:35,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:32:35,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:35,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2022-02-21 03:32:35,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:35,357 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-21 03:32:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2022-02-21 03:32:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-02-21 03:32:35,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:35,358 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:32:35,358 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:32:35,358 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:32:35,359 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:35,360 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:32:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:32:35,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:35,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:35,361 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:32:35,361 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:32:35,361 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:35,362 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:32:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:32:35,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:35,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:35,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:35,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:35,367 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:32:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-02-21 03:32:35,368 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:32:35,368 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:32:35,368 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:32:35,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2022-02-21 03:32:35,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:35,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:35,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:35,369 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:35,369 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:35,370 INFO L791 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 500#L565 assume !(main_~length1~0#1 < 1); 501#L565-2 assume !(main_~length2~0#1 < 1); 517#L568-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 506#L552-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 507#L552-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 521#L555-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 519#L555-1 assume !cstrspn_#t~short7#1; 512#L555-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 513#L555-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 518#L557 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 502#L552-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 503#L552-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 508#L552-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 511#L555-5 [2022-02-21 03:32:35,370 INFO L793 eck$LassoCheckResult]: Loop: 511#L555-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 514#L555-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 510#L555-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 511#L555-5 [2022-02-21 03:32:35,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:35,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2022-02-21 03:32:35,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:35,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980877275] [2022-02-21 03:32:35,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:35,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {648#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {648#true} is VALID [2022-02-21 03:32:35,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {648#true} is VALID [2022-02-21 03:32:35,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {648#true} assume !(main_~length1~0#1 < 1); {648#true} is VALID [2022-02-21 03:32:35,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {648#true} assume !(main_~length2~0#1 < 1); {648#true} is VALID [2022-02-21 03:32:35,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {648#true} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {648#true} is VALID [2022-02-21 03:32:35,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {648#true} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {650#(= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) |ULTIMATE.start_cstrspn_#t~mem3#1|)} is VALID [2022-02-21 03:32:35,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#(= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) |ULTIMATE.start_cstrspn_#t~mem3#1|)} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {651#(not (= |ULTIMATE.start_cstrspn_~c~0#1| 0))} is VALID [2022-02-21 03:32:35,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {651#(not (= |ULTIMATE.start_cstrspn_~c~0#1| 0))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {652#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|)) |ULTIMATE.start_cstrspn_#t~short7#1|)} is VALID [2022-02-21 03:32:35,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {652#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|)) |ULTIMATE.start_cstrspn_#t~short7#1|)} assume !cstrspn_#t~short7#1; {653#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:32:35,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; {653#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:32:35,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {653#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrspn_~s~0#1.base|) |ULTIMATE.start_cstrspn_~s~0#1.offset|) |ULTIMATE.start_cstrspn_~c~0#1|))} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {654#(not (= |ULTIMATE.start_cstrspn_#t~mem9#1| |ULTIMATE.start_cstrspn_~c~0#1|))} is VALID [2022-02-21 03:32:35,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {654#(not (= |ULTIMATE.start_cstrspn_#t~mem9#1| |ULTIMATE.start_cstrspn_~c~0#1|))} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {649#false} is VALID [2022-02-21 03:32:35,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {649#false} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {649#false} is VALID [2022-02-21 03:32:35,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {649#false} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {649#false} is VALID [2022-02-21 03:32:35,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {649#false} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {649#false} is VALID [2022-02-21 03:32:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:35,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:35,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980877275] [2022-02-21 03:32:35,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980877275] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:35,428 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:35,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:32:35,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121610560] [2022-02-21 03:32:35,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:35,429 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:32:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:35,429 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2022-02-21 03:32:35,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:35,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008649187] [2022-02-21 03:32:35,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:35,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,438 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:35,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:35,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:32:35,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:32:35,548 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:35,662 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-21 03:32:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:32:35,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:35,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:35,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2022-02-21 03:32:35,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:35,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2022-02-21 03:32:35,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:32:35,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:35,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2022-02-21 03:32:35,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:32:35,683 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-02-21 03:32:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2022-02-21 03:32:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-21 03:32:35,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:35,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:35,685 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:35,685 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:35,685 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:35,686 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:32:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:32:35,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:35,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:35,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states and 35 transitions. [2022-02-21 03:32:35,687 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states and 35 transitions. [2022-02-21 03:32:35,687 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:32:35,688 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:32:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:32:35,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:35,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:35,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:35,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-21 03:32:35,690 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 03:32:35,690 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 03:32:35,690 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:32:35,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2022-02-21 03:32:35,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:35,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:35,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:35,691 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:35,691 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:32:35,691 INFO L791 eck$LassoCheckResult]: Stem: 697#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 698#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 695#L565 assume !(main_~length1~0#1 < 1); 696#L565-2 assume !(main_~length2~0#1 < 1); 712#L568-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 701#L552-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 702#L552-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 708#L555-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 710#L555-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 715#L555-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 713#L555-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 714#L557 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 699#L552-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 700#L552-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 703#L552-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 706#L555-5 [2022-02-21 03:32:35,691 INFO L793 eck$LassoCheckResult]: Loop: 706#L555-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 709#L555-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 705#L555-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 706#L555-5 [2022-02-21 03:32:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2022-02-21 03:32:35,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:35,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686518684] [2022-02-21 03:32:35,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:35,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,715 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,727 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:35,727 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2022-02-21 03:32:35,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:35,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767742346] [2022-02-21 03:32:35,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:35,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,735 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:35,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:35,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2022-02-21 03:32:35,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:35,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625693291] [2022-02-21 03:32:35,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:35,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:35,811 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:35,835 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:32:36,489 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:36,489 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:36,489 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:36,489 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:36,489 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:36,489 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:36,489 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:36,489 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:36,489 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration5_Lasso [2022-02-21 03:32:36,489 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:36,489 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:36,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,510 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:32:36,513 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:32:36,515 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:32:36,516 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:32:36,518 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:32:36,521 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:32:36,522 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:32:36,529 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:32:36,532 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:32:36,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:36,537 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:32:36,539 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:32:36,551 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:32:37,347 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:32:37,349 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:32:37,351 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:32:37,353 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:32:37,355 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:32:37,357 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:32:37,358 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:32:37,363 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:32:38,312 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:38,313 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:38,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,314 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:32:38,315 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:32:38,316 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:32:38,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:38,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:38,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:38,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:38,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,353 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:32:38,354 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:32:38,355 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:32:38,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:38,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:38,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:38,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:38,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,394 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:32:38,396 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:32:38,396 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:32:38,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:38,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:38,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,422 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:32:38,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,425 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:32:38,426 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:32:38,427 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:32:38,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:38,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:38,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:38,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,456 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:32:38,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,458 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:32:38,464 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:32:38,465 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:32:38,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:38,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:38,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:38,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,497 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:32:38,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,498 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:32:38,499 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:32:38,501 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:32:38,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:38,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:38,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:38,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,537 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:32:38,538 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:32:38,540 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:32:38,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:38,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:38,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:38,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:38,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,581 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:32:38,590 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:32:38,591 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:32:38,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:38,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:38,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:38,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,626 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:32:38,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,628 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:32:38,629 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:32:38,630 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:32:38,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:38,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:38,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:38,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,655 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:32:38,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,656 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:32:38,657 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:32:38,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:38,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:38,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:38,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,694 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:32:38,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,696 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:38,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:32:38,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:38,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:38,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:38,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:38,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:38,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,741 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:32:38,743 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:32:38,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:32:38,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:38,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:38,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:38,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,782 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:32:38,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,783 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:32:38,787 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:32:38,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:38,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:38,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:38,806 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:32:38,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,830 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:32:38,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,832 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:32:38,832 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:32:38,834 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:32:38,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:38,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:38,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:38,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,870 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:32:38,871 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:32:38,872 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:32:38,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:38,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:38,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:38,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:38,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:38,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:38,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:38,919 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:32:38,920 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:32:38,922 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:32:38,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:38,928 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:32:38,928 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-02-21 03:32:38,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:38,991 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2022-02-21 03:32:38,991 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-02-21 03:32:39,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:39,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:39,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:39,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:39,130 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:32:39,131 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:32:39,132 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:32:39,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:39,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:39,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:39,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:39,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:39,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:39,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:39,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:39,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:39,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:39,160 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:32:39,163 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:32:39,164 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:32:39,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:39,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:39,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:39,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:39,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:39,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:39,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:39,194 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:32:39,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:39,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:39,195 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:32:39,196 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:32:39,197 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:32:39,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:39,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:39,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:39,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:39,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:39,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:39,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:39,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:39,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:39,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:39,253 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:32:39,254 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:32:39,256 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:32:39,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:39,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:39,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:39,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:39,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:39,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:39,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:39,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:39,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:39,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:39,282 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:32:39,283 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:32:39,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:39,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:39,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:39,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:39,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:39,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:39,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:39,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:39,355 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 03:32:39,355 INFO L444 ModelExtractionUtils]: 28 out of 52 variables were initially zero. Simplification set additionally 21 variables to zero. [2022-02-21 03:32:39,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:39,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:39,356 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:32:39,357 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:32:39,358 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:39,364 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:39,364 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:39,365 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1) = -1*ULTIMATE.start_cstrspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_1 Supporting invariants [] [2022-02-21 03:32:39,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:39,556 INFO L297 tatePredicateManager]: 31 out of 33 supporting invariants were superfluous and have been removed [2022-02-21 03:32:39,563 INFO L390 LassoCheck]: Loop: "call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1;" "assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256);" "assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset;" [2022-02-21 03:32:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:39,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:39,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:32:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:39,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:39,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {843#unseeded} is VALID [2022-02-21 03:32:39,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {843#unseeded} is VALID [2022-02-21 03:32:39,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#unseeded} assume !(main_~length1~0#1 < 1); {843#unseeded} is VALID [2022-02-21 03:32:39,782 INFO L290 TraceCheckUtils]: 3: Hoare triple {843#unseeded} assume !(main_~length2~0#1 < 1); {843#unseeded} is VALID [2022-02-21 03:32:39,783 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:39,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {1044#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1023#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:39,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:32:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:39,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:39,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {1024#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1075#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:32:39,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {1075#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1075#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:32:39,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {1075#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; {1026#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))) (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:39,849 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:32:39,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:39,871 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:32:39,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,871 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:32:39,871 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:39,946 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 51 transitions. Complement of second has 6 states. [2022-02-21 03:32:39,946 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:32:39,946 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:39,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:39,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:39,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:39,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:39,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:39,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:39,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:39,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:32:39,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:39,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:39,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:39,950 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:39,952 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:39,952 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:39,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:39,952 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:39,953 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:32:39,953 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:39,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:39,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:39,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:39,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:32:39,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:32:39,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:32:39,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:32:39,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:32:39,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:32:39,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:39,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:39,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:39,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:39,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:39,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:39,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:39,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:39,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:39,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:39,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:39,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:39,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:39,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:39,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:39,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:39,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:39,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:39,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,960 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:32:39,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:39,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:39,962 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:39,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:40,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:32:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:40,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:40,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {843#unseeded} is VALID [2022-02-21 03:32:40,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {843#unseeded} is VALID [2022-02-21 03:32:40,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#unseeded} assume !(main_~length1~0#1 < 1); {843#unseeded} is VALID [2022-02-21 03:32:40,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {843#unseeded} assume !(main_~length2~0#1 < 1); {843#unseeded} is VALID [2022-02-21 03:32:40,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {1150#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1023#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:40,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:32:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:40,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:40,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {1024#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1181#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:32:40,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1181#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:32:40,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; {1026#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))) (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,187 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:32:40,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:40,212 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:32:40,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,212 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:32:40,212 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:40,258 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 51 transitions. Complement of second has 6 states. [2022-02-21 03:32:40,258 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:32:40,258 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:40,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:40,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:40,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:40,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:40,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:40,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:40,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:40,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:32:40,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:32:40,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:40,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:40,260 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:40,260 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:40,260 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:40,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:40,260 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:40,261 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:32:40,266 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:40,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:32:40,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:32:40,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:32:40,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:32:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:32:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:32:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:40,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:40,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:40,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:40,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:40,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:40,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:40,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:40,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:40,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,271 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:32:40,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,273 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:32:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:40,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:32:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:40,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:40,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {843#unseeded} is VALID [2022-02-21 03:32:40,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {843#unseeded} is VALID [2022-02-21 03:32:40,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#unseeded} assume !(main_~length1~0#1 < 1); {843#unseeded} is VALID [2022-02-21 03:32:40,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {843#unseeded} assume !(main_~length2~0#1 < 1); {843#unseeded} is VALID [2022-02-21 03:32:40,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {843#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {1256#(and unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_cstrspn_~s2#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; {1023#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) unseeded (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:40,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:32:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:40,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:40,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {1024#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; {1287#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:32:40,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {1287#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); {1287#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} is VALID [2022-02-21 03:32:40,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {1287#(and (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (<= (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|)))} assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; {1026#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (* (- 1) |ULTIMATE.start_cstrspn_~s~0#1.offset|))))) (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_cstrspn_~s~0#1.base|) (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|))} is VALID [2022-02-21 03:32:40,489 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:32:40,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:40,502 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:32:40,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,502 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:32:40,502 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:40,567 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 53 transitions. Complement of second has 5 states. [2022-02-21 03:32:40,568 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:32:40,568 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:40,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:40,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:40,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:40,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:40,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:40,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:40,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:40,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2022-02-21 03:32:40,571 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:40,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:40,571 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:32:40,571 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:32:40,571 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:40,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:40,573 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:32:40,573 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:32:40,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:32:40,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:40,573 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:32:40,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:32:40,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:32:40,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:32:40,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:32:40,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:32:40,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:32:40,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:40,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:40,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:32:40,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:40,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:40,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:32:40,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:40,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:40,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:32:40,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:32:40,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,582 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-21 03:32:40,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:32:40,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:32:40,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:32:40,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:40,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:32:40,593 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:40,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2022-02-21 03:32:40,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:32:40,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:32:40,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:32:40,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:40,593 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:40,593 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:40,593 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:32:40,593 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:32:40,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:32:40,593 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:32:40,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:32:40,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:32:40 BoogieIcfgContainer [2022-02-21 03:32:40,598 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:32:40,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:32:40,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:32:40,599 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:32:40,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:28" (3/4) ... [2022-02-21 03:32:40,602 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:32:40,602 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:32:40,604 INFO L158 Benchmark]: Toolchain (without parser) took 12918.27ms. Allocated memory was 109.1MB in the beginning and 218.1MB in the end (delta: 109.1MB). Free memory was 67.0MB in the beginning and 89.8MB in the end (delta: -22.9MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2022-02-21 03:32:40,605 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 117.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:40,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.17ms. Allocated memory is still 109.1MB. Free memory was 66.7MB in the beginning and 78.3MB in the end (delta: -11.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2022-02-21 03:32:40,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.04ms. Allocated memory is still 109.1MB. Free memory was 77.8MB in the beginning and 75.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:40,605 INFO L158 Benchmark]: Boogie Preprocessor took 30.30ms. Allocated memory is still 109.1MB. Free memory was 75.7MB in the beginning and 73.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:40,605 INFO L158 Benchmark]: RCFGBuilder took 547.22ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 75.5MB in the end (delta: -1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:32:40,606 INFO L158 Benchmark]: BuchiAutomizer took 11945.41ms. Allocated memory was 109.1MB in the beginning and 218.1MB in the end (delta: 109.1MB). Free memory was 75.5MB in the beginning and 90.9MB in the end (delta: -15.4MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:40,606 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 218.1MB. Free memory was 90.9MB in the beginning and 89.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:40,607 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.15ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 117.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.17ms. Allocated memory is still 109.1MB. Free memory was 66.7MB in the beginning and 78.3MB in the end (delta: -11.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.04ms. Allocated memory is still 109.1MB. Free memory was 77.8MB in the beginning and 75.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.30ms. Allocated memory is still 109.1MB. Free memory was 75.7MB in the beginning and 73.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 547.22ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 75.5MB in the end (delta: -1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 11945.41ms. Allocated memory was 109.1MB in the beginning and 218.1MB in the end (delta: 109.1MB). Free memory was 75.5MB in the beginning and 90.9MB in the end (delta: -15.4MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 218.1MB. Free memory was 90.9MB in the beginning and 89.8MB in the end (delta: 1.0MB). 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 unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 105 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital270 mio100 ax106 hnf100 lsp96 ukn74 mio100 lsp33 div134 bol100 ite100 ukn100 eq166 hnf93 smp80 dnf574 smp28 tf100 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 192ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:32:40,624 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