./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-crafted-lit/cstrcspn.c -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 475c55af8223c9a32959cab18313111543780f4e37aae19089bc5e981127ec42 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 14:42:34,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 14:42:34,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 14:42:34,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 14:42:34,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 14:42:34,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 14:42:34,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 14:42:34,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 14:42:34,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 14:42:34,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 14:42:34,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 14:42:34,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 14:42:34,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 14:42:34,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 14:42:34,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 14:42:34,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 14:42:34,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 14:42:34,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 14:42:34,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 14:42:34,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 14:42:34,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 14:42:34,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 14:42:34,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 14:42:34,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 14:42:34,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 14:42:34,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 14:42:34,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 14:42:34,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 14:42:34,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 14:42:34,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 14:42:34,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 14:42:34,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 14:42:34,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 14:42:34,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 14:42:34,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 14:42:34,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 14:42:34,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 14:42:34,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 14:42:34,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 14:42:34,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 14:42:34,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 14:42:34,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-14 14:42:34,109 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 14:42:34,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 14:42:34,109 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 14:42:34,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 14:42:34,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 14:42:34,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 14:42:34,111 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 14:42:34,111 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-14 14:42:34,111 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-14 14:42:34,111 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-14 14:42:34,112 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-14 14:42:34,112 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-14 14:42:34,112 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-14 14:42:34,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 14:42:34,112 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 14:42:34,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 14:42:34,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 14:42:34,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-14 14:42:34,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-14 14:42:34,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-14 14:42:34,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 14:42:34,113 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-14 14:42:34,113 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 14:42:34,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-14 14:42:34,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 14:42:34,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 14:42:34,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 14:42:34,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 14:42:34,115 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-14 14:42:34,115 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 -> 475c55af8223c9a32959cab18313111543780f4e37aae19089bc5e981127ec42 [2023-02-14 14:42:34,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 14:42:34,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 14:42:34,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 14:42:34,310 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 14:42:34,310 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 14:42:34,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c [2023-02-14 14:42:35,220 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 14:42:35,358 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 14:42:35,359 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrcspn.c [2023-02-14 14:42:35,363 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880d0135c/78f5f044fac94f1ba4ca6e461b7d7cd0/FLAGfdd40ddd4 [2023-02-14 14:42:35,372 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880d0135c/78f5f044fac94f1ba4ca6e461b7d7cd0 [2023-02-14 14:42:35,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 14:42:35,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 14:42:35,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 14:42:35,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 14:42:35,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 14:42:35,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ddd771f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35, skipping insertion in model container [2023-02-14 14:42:35,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 14:42:35,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 14:42:35,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:42:35,519 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 14:42:35,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:42:35,544 INFO L208 MainTranslator]: Completed translation [2023-02-14 14:42:35,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35 WrapperNode [2023-02-14 14:42:35,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 14:42:35,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 14:42:35,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 14:42:35,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 14:42:35,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,578 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2023-02-14 14:42:35,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 14:42:35,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 14:42:35,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 14:42:35,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 14:42:35,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,614 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 14:42:35,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 14:42:35,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 14:42:35,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 14:42:35,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (1/1) ... [2023-02-14 14:42:35,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:35,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:35,647 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) [2023-02-14 14:42:35,658 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 [2023-02-14 14:42:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 14:42:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 14:42:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 14:42:35,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 14:42:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 14:42:35,743 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 14:42:35,745 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 14:42:35,913 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 14:42:35,917 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 14:42:35,918 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 14:42:35,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:42:35 BoogieIcfgContainer [2023-02-14 14:42:35,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 14:42:35,946 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-14 14:42:35,947 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-14 14:42:35,949 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-14 14:42:35,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 14:42:35,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.02 02:42:35" (1/3) ... [2023-02-14 14:42:35,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@232d23c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 02:42:35, skipping insertion in model container [2023-02-14 14:42:35,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 14:42:35,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:35" (2/3) ... [2023-02-14 14:42:35,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@232d23c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 02:42:35, skipping insertion in model container [2023-02-14 14:42:35,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 14:42:35,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:42:35" (3/3) ... [2023-02-14 14:42:35,952 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrcspn.c [2023-02-14 14:42:36,008 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-14 14:42:36,008 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-14 14:42:36,008 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-14 14:42:36,008 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-14 14:42:36,008 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-14 14:42:36,008 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-14 14:42:36,009 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-14 14:42:36,009 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-14 14:42:36,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:36,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 14:42:36,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:36,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:36,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:36,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:42:36,032 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-14 14:42:36,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:36,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 14:42:36,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:36,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:36,036 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:36,037 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:42:36,047 INFO L748 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 7#L14true assume !(build_nondet_String_~length~0#1 < 1); 18#L14-2true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 2#build_nondet_String_returnLabel#1true main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 8#L14-3true assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 14#L14-5true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 13#build_nondet_String_returnLabel#2true main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 19#L30-4true [2023-02-14 14:42:36,049 INFO L750 eck$LassoCheckResult]: Loop: 19#L30-4true call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 9#L30-1true assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 12#L33-5true assume !true; 11#L33-6true call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 22#L35true assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 20#L30-3true cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 19#L30-4true [2023-02-14 14:42:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:36,054 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2023-02-14 14:42:36,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:36,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12257732] [2023-02-14 14:42:36,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:36,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:36,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:36,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:36,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:36,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2023-02-14 14:42:36,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:36,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976964863] [2023-02-14 14:42:36,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:36,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:36,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:36,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976964863] [2023-02-14 14:42:36,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976964863] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:42:36,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:42:36,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:42:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731130857] [2023-02-14 14:42:36,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:42:36,298 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:42:36,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:42:36,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 14:42:36,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 14:42:36,323 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 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) [2023-02-14 14:42:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:42:36,328 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-02-14 14:42:36,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2023-02-14 14:42:36,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 14:42:36,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2023-02-14 14:42:36,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-02-14 14:42:36,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-02-14 14:42:36,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2023-02-14 14:42:36,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 14:42:36,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-14 14:42:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2023-02-14 14:42:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-14 14:42:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-02-14 14:42:36,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-14 14:42:36,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 14:42:36,354 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-14 14:42:36,354 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-14 14:42:36,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2023-02-14 14:42:36,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 14:42:36,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:36,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:36,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:36,355 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:36,356 INFO L748 eck$LassoCheckResult]: Stem: 64#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 54#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 55#L14 assume !(build_nondet_String_~length~0#1 < 1); 56#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 50#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 51#L14-3 assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 57#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 62#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 63#L30-4 [2023-02-14 14:42:36,356 INFO L750 eck$LassoCheckResult]: Loop: 63#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 58#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 59#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 52#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 53#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 60#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 61#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 65#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 63#L30-4 [2023-02-14 14:42:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:36,357 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2023-02-14 14:42:36,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:36,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834746859] [2023-02-14 14:42:36,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:36,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:36,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:36,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:36,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2023-02-14 14:42:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:36,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576631094] [2023-02-14 14:42:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:36,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:36,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:36,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:36,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:36,419 INFO L85 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2023-02-14 14:42:36,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:36,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61415841] [2023-02-14 14:42:36,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:36,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:36,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61415841] [2023-02-14 14:42:36,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61415841] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:42:36,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:42:36,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 14:42:36,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845418304] [2023-02-14 14:42:36,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:42:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:42:37,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 14:42:37,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 14:42:37,090 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:42:37,191 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-02-14 14:42:37,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2023-02-14 14:42:37,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 14:42:37,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2023-02-14 14:42:37,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-02-14 14:42:37,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-02-14 14:42:37,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2023-02-14 14:42:37,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 14:42:37,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-02-14 14:42:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2023-02-14 14:42:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2023-02-14 14:42:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-02-14 14:42:37,202 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-02-14 14:42:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 14:42:37,203 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-02-14 14:42:37,204 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-14 14:42:37,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2023-02-14 14:42:37,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 14:42:37,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:37,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:37,207 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:37,207 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:37,208 INFO L748 eck$LassoCheckResult]: Stem: 136#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 122#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 123#L14 assume !(build_nondet_String_~length~0#1 < 1); 124#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 118#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 119#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 125#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 135#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 142#L30-4 [2023-02-14 14:42:37,208 INFO L750 eck$LassoCheckResult]: Loop: 142#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 141#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 131#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 132#L33-1 assume !cstrcspn_#t~short7#1; 137#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 129#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 130#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 143#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 142#L30-4 [2023-02-14 14:42:37,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:37,208 INFO L85 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2023-02-14 14:42:37,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:37,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544689910] [2023-02-14 14:42:37,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:37,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:37,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:37,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1951138125, now seen corresponding path program 1 times [2023-02-14 14:42:37,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:37,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799363244] [2023-02-14 14:42:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:37,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:37,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:37,259 INFO L85 PathProgramCache]: Analyzing trace with hash -252975234, now seen corresponding path program 1 times [2023-02-14 14:42:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:37,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250527110] [2023-02-14 14:42:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:37,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:37,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:37,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:37,861 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:42:37,862 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:42:37,862 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:42:37,862 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:42:37,862 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:42:37,862 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:37,862 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:42:37,862 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:42:37,862 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration3_Lasso [2023-02-14 14:42:37,863 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:42:37,863 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:42:37,879 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,884 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,886 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,888 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,890 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,892 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,893 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,894 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,896 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,898 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,900 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,901 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,902 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,904 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:37,905 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:38,239 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:38,241 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:38,243 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:38,244 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:38,814 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:42:38,819 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:42:38,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:38,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:38,823 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) [2023-02-14 14:42:38,830 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 [2023-02-14 14:42:38,830 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 [2023-02-14 14:42:38,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:38,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:38,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:38,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:38,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:38,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:38,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:38,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:38,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:38,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:38,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:38,862 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) [2023-02-14 14:42:38,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 [2023-02-14 14:42:38,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:38,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:38,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:38,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:38,880 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 [2023-02-14 14:42:38,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:38,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:38,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:38,915 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 [2023-02-14 14:42:38,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:38,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:38,919 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) [2023-02-14 14:42:38,930 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 [2023-02-14 14:42:38,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:38,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:38,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:38,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:38,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:38,937 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 [2023-02-14 14:42:38,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:38,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:38,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:38,957 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 [2023-02-14 14:42:38,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:38,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:38,959 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) [2023-02-14 14:42:38,960 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 [2023-02-14 14:42:38,962 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 [2023-02-14 14:42:38,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:38,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:38,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:38,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:38,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:38,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:38,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:38,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:38,996 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 [2023-02-14 14:42:38,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:38,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:38,997 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) [2023-02-14 14:42:38,999 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 [2023-02-14 14:42:39,001 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 [2023-02-14 14:42:39,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:39,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:39,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:39,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-02-14 14:42:39,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,037 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) [2023-02-14 14:42:39,037 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 [2023-02-14 14:42:39,039 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 [2023-02-14 14:42:39,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:39,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:39,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:39,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:39,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,067 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) [2023-02-14 14:42:39,069 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 [2023-02-14 14:42:39,071 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 [2023-02-14 14:42:39,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:39,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:39,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:39,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:39,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,099 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) [2023-02-14 14:42:39,101 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 [2023-02-14 14:42:39,103 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 [2023-02-14 14:42:39,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:39,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:39,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:39,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,117 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 [2023-02-14 14:42:39,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,118 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) [2023-02-14 14:42:39,119 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 [2023-02-14 14:42:39,122 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 [2023-02-14 14:42:39,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:39,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:39,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:39,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,157 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) [2023-02-14 14:42:39,159 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 [2023-02-14 14:42:39,161 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 [2023-02-14 14:42:39,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:39,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:39,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:39,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,172 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 [2023-02-14 14:42:39,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,173 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) [2023-02-14 14:42:39,174 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 [2023-02-14 14:42:39,176 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 [2023-02-14 14:42:39,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:39,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:39,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:39,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:39,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,198 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) [2023-02-14 14:42:39,198 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 [2023-02-14 14:42:39,201 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 [2023-02-14 14:42:39,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:39,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:39,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:39,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:39,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,221 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) [2023-02-14 14:42:39,221 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 [2023-02-14 14:42:39,224 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 [2023-02-14 14:42:39,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:39,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:39,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:39,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,248 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 [2023-02-14 14:42:39,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,250 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) [2023-02-14 14:42:39,265 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 [2023-02-14 14:42:39,266 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 [2023-02-14 14:42:39,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:39,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:39,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:39,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,290 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 [2023-02-14 14:42:39,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,291 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) [2023-02-14 14:42:39,293 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 [2023-02-14 14:42:39,295 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 [2023-02-14 14:42:39,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:39,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:39,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,327 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 [2023-02-14 14:42:39,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,328 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) [2023-02-14 14:42:39,330 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 [2023-02-14 14:42:39,331 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 [2023-02-14 14:42:39,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:39,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:39,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:39,347 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 [2023-02-14 14:42:39,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,349 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) [2023-02-14 14:42:39,349 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 [2023-02-14 14:42:39,353 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 [2023-02-14 14:42:39,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:39,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:39,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:39,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:39,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:39,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:39,374 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:42:39,398 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-02-14 14:42:39,398 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-02-14 14:42:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:39,401 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) [2023-02-14 14:42:39,403 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 [2023-02-14 14:42:39,416 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:42:39,450 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-14 14:42:39,451 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:42:39,451 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1, ULTIMATE.start_cstrcspn_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset Supporting invariants [] [2023-02-14 14:42:39,457 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 [2023-02-14 14:42:39,470 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2023-02-14 14:42:39,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:39,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 14:42:39,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:39,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 14:42:39,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:39,598 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-14 14:42:39,599 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:39,649 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 44 states and 52 transitions. Complement of second has 4 states. [2023-02-14 14:42:39,650 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 [2023-02-14 14:42:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2023-02-14 14:42:39,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2023-02-14 14:42:39,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:39,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2023-02-14 14:42:39,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:39,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2023-02-14 14:42:39,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:39,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2023-02-14 14:42:39,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 14:42:39,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2023-02-14 14:42:39,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-02-14 14:42:39,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-02-14 14:42:39,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2023-02-14 14:42:39,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:42:39,654 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-02-14 14:42:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2023-02-14 14:42:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-14 14:42:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-02-14 14:42:39,655 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-02-14 14:42:39,655 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-02-14 14:42:39,655 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-14 14:42:39,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2023-02-14 14:42:39,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 14:42:39,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:39,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:39,656 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:39,656 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 14:42:39,656 INFO L748 eck$LassoCheckResult]: Stem: 304#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 293#L14 assume !(build_nondet_String_~length~0#1 < 1); 294#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 285#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 286#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 295#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 302#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 303#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 296#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 297#L33-5 [2023-02-14 14:42:39,656 INFO L750 eck$LassoCheckResult]: Loop: 297#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 287#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 288#L33-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 297#L33-5 [2023-02-14 14:42:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2023-02-14 14:42:39,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:39,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064480112] [2023-02-14 14:42:39,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:39,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:39,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:39,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:39,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2023-02-14 14:42:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:39,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436153613] [2023-02-14 14:42:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:39,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:39,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:39,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:39,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2023-02-14 14:42:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:39,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161379706] [2023-02-14 14:42:39,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:39,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:39,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:39,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:40,051 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 [2023-02-14 14:42:40,274 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:42:40,275 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:42:40,275 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:42:40,275 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:42:40,275 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:42:40,275 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:40,275 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:42:40,275 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:42:40,275 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration4_Lasso [2023-02-14 14:42:40,275 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:42:40,275 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:42:40,277 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,280 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,282 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,284 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,286 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,287 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,290 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,634 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,636 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,637 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,640 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,641 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,643 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,645 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,647 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,648 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,650 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,651 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:40,652 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:41,405 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:42:41,406 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:42:41,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:41,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:41,407 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) [2023-02-14 14:42:41,415 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 [2023-02-14 14:42:41,415 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 [2023-02-14 14:42:41,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:41,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:41,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:41,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:41,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:41,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:41,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:41,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:41,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:41,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:41,441 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) [2023-02-14 14:42:41,443 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 [2023-02-14 14:42:41,444 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 [2023-02-14 14:42:41,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:41,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:41,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:41,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:41,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:41,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:41,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:41,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:41,464 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 [2023-02-14 14:42:41,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:41,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:41,465 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) [2023-02-14 14:42:41,467 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 [2023-02-14 14:42:41,469 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 [2023-02-14 14:42:41,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:41,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:41,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:41,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:41,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:41,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:41,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:41,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:41,502 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 [2023-02-14 14:42:41,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:41,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:41,504 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) [2023-02-14 14:42:41,506 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 [2023-02-14 14:42:41,507 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 [2023-02-14 14:42:41,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:41,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:41,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:41,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:41,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:41,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:41,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:41,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:41,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-02-14 14:42:41,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:41,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:41,529 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) [2023-02-14 14:42:41,529 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 [2023-02-14 14:42:41,531 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 [2023-02-14 14:42:41,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:41,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:41,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:41,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:41,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:41,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:41,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:41,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:41,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-02-14 14:42:41,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:41,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:41,542 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) [2023-02-14 14:42:41,543 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 [2023-02-14 14:42:41,546 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 [2023-02-14 14:42:41,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:41,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:41,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:41,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:41,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:41,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:41,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:41,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:41,555 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 [2023-02-14 14:42:41,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:41,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:41,556 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) [2023-02-14 14:42:41,556 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 [2023-02-14 14:42:41,559 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 [2023-02-14 14:42:41,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:41,566 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-02-14 14:42:41,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:41,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:41,585 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2023-02-14 14:42:41,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:41,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:41,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:41,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:41,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:41,612 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) [2023-02-14 14:42:41,613 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 [2023-02-14 14:42:41,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 14:42:41,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:41,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:41,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:41,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:41,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:41,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:41,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:41,646 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 [2023-02-14 14:42:41,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:41,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:41,647 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) [2023-02-14 14:42:41,649 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 [2023-02-14 14:42:41,650 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 [2023-02-14 14:42:41,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:41,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:41,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:41,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:41,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:41,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:41,678 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:42:41,690 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-02-14 14:42:41,690 INFO L444 ModelExtractionUtils]: 8 out of 34 variables were initially zero. Simplification set additionally 23 variables to zero. [2023-02-14 14:42:41,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:41,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:41,691 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) [2023-02-14 14:42:41,692 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 [2023-02-14 14:42:41,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:42:41,701 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-14 14:42:41,701 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:42:41,701 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_2, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2023-02-14 14:42:41,704 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 [2023-02-14 14:42:41,729 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2023-02-14 14:42:41,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:41,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 14:42:41,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:41,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 14:42:41,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:41,822 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2023-02-14 14:42:41,823 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2023-02-14 14:42:41,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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 49 states and 59 transitions. Complement of second has 7 states. [2023-02-14 14:42:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-14 14:42:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2023-02-14 14:42:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-02-14 14:42:41,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2023-02-14 14:42:41,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:41,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2023-02-14 14:42:41,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:41,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2023-02-14 14:42:41,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:41,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2023-02-14 14:42:41,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 14:42:41,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2023-02-14 14:42:41,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-02-14 14:42:41,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-02-14 14:42:41,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2023-02-14 14:42:41,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:42:41,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-02-14 14:42:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2023-02-14 14:42:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2023-02-14 14:42:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 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) [2023-02-14 14:42:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-02-14 14:42:41,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-02-14 14:42:41,875 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-02-14 14:42:41,875 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-14 14:42:41,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2023-02-14 14:42:41,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 14:42:41,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:41,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:41,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:41,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 14:42:41,876 INFO L748 eck$LassoCheckResult]: Stem: 479#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 465#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 466#L14 assume !(build_nondet_String_~length~0#1 < 1); 467#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 459#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 460#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 468#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 477#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 478#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 471#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 472#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 463#L33-1 assume !cstrcspn_#t~short7#1; 464#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 473#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 474#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 481#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 482#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 469#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 470#L33-5 [2023-02-14 14:42:41,877 INFO L750 eck$LassoCheckResult]: Loop: 470#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 461#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 462#L33-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 470#L33-5 [2023-02-14 14:42:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 2 times [2023-02-14 14:42:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:41,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531607864] [2023-02-14 14:42:41,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:41,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:41,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:41,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:41,899 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2023-02-14 14:42:41,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:41,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2309382] [2023-02-14 14:42:41,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:41,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:41,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:41,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:41,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash -238092697, now seen corresponding path program 1 times [2023-02-14 14:42:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:41,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210724398] [2023-02-14 14:42:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:41,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:42,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:42,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210724398] [2023-02-14 14:42:42,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210724398] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:42:42,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815000215] [2023-02-14 14:42:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:42,055 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:42,075 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 [2023-02-14 14:42:42,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-02-14 14:42:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:42,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-14 14:42:42,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:42,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 14:42:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:42,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:42:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:42,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815000215] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:42:42,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 14:42:42,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 16 [2023-02-14 14:42:42,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678638674] [2023-02-14 14:42:42,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 14:42:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:42:42,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 14:42:42,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-02-14 14:42:42,352 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:42:42,492 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2023-02-14 14:42:42,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 67 transitions. [2023-02-14 14:42:42,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 14:42:42,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 45 states and 54 transitions. [2023-02-14 14:42:42,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-02-14 14:42:42,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-02-14 14:42:42,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2023-02-14 14:42:42,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:42:42,494 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-02-14 14:42:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2023-02-14 14:42:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2023-02-14 14:42:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-02-14 14:42:42,495 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-02-14 14:42:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 14:42:42,496 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-02-14 14:42:42,496 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-14 14:42:42,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2023-02-14 14:42:42,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 14:42:42,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:42,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:42,498 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:42,498 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 14:42:42,498 INFO L748 eck$LassoCheckResult]: Stem: 717#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 704#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 705#L14 assume !(build_nondet_String_~length~0#1 < 1); 706#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 698#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 699#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 707#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 715#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 716#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 722#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 725#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 702#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 703#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 712#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 713#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 720#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 721#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 708#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 709#L33-5 [2023-02-14 14:42:42,498 INFO L750 eck$LassoCheckResult]: Loop: 709#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 700#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 701#L33-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 709#L33-5 [2023-02-14 14:42:42,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:42,498 INFO L85 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 1 times [2023-02-14 14:42:42,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:42,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484109775] [2023-02-14 14:42:42,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:42,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:42,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:42,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:42,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:42,519 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2023-02-14 14:42:42,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:42,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797592275] [2023-02-14 14:42:42,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:42,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:42,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:42,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:42,532 INFO L85 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2023-02-14 14:42:42,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:42,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788874712] [2023-02-14 14:42:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:42,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:42,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:43,495 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:42:43,496 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:42:43,496 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:42:43,496 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:42:43,496 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:42:43,496 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:43,496 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:42:43,496 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:42:43,496 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration6_Lasso [2023-02-14 14:42:43,496 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:42:43,496 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:42:43,499 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:43,500 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,041 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,053 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,054 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,056 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,057 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,059 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,060 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,063 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,065 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,067 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,068 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,069 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,071 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,073 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,074 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,075 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:44,077 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:45,202 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:42:45,202 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:42:45,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:45,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:45,204 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) [2023-02-14 14:42:45,205 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 [2023-02-14 14:42:45,207 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 [2023-02-14 14:42:45,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:45,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:45,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:45,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:45,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:45,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:45,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:45,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:45,223 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 [2023-02-14 14:42:45,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:45,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:45,224 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) [2023-02-14 14:42:45,226 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 [2023-02-14 14:42:45,227 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 [2023-02-14 14:42:45,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:45,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:45,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:45,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:45,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:45,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:45,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:45,259 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 [2023-02-14 14:42:45,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:45,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:45,260 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) [2023-02-14 14:42:45,262 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 [2023-02-14 14:42:45,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 14:42:45,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:45,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:45,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:45,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:45,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:45,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:45,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:45,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-02-14 14:42:45,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:45,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:45,283 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) [2023-02-14 14:42:45,284 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 [2023-02-14 14:42:45,286 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 [2023-02-14 14:42:45,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:45,292 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2023-02-14 14:42:45,292 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2023-02-14 14:42:45,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:45,391 INFO L401 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2023-02-14 14:42:45,391 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2023-02-14 14:42:45,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:45,553 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 [2023-02-14 14:42:45,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:45,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:45,555 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) [2023-02-14 14:42:45,557 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 [2023-02-14 14:42:45,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 14:42:45,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:45,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:45,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:45,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:45,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:45,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:45,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:45,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:45,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:45,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:45,587 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) [2023-02-14 14:42:45,589 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 [2023-02-14 14:42:45,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 [2023-02-14 14:42:45,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:45,598 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-02-14 14:42:45,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:45,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:45,607 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2023-02-14 14:42:45,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:45,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:45,630 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 [2023-02-14 14:42:45,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:45,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:45,631 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) [2023-02-14 14:42:45,634 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 [2023-02-14 14:42:45,636 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 [2023-02-14 14:42:45,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:45,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:45,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:45,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:45,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:45,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 14:42:45,665 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:42:45,696 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2023-02-14 14:42:45,696 INFO L444 ModelExtractionUtils]: 26 out of 43 variables were initially zero. Simplification set additionally 14 variables to zero. [2023-02-14 14:42:45,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:45,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:45,699 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) [2023-02-14 14:42:45,699 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 [2023-02-14 14:42:45,700 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:42:45,721 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-14 14:42:45,721 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:42:45,721 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2023-02-14 14:42:45,732 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 [2023-02-14 14:42:45,780 INFO L156 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2023-02-14 14:42:45,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:45,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 14:42:45,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:45,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 14:42:45,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:45,890 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2023-02-14 14:42:45,891 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:45,936 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 49 states and 60 transitions. Complement of second has 7 states. [2023-02-14 14:42:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-14 14:42:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-02-14 14:42:45,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-14 14:42:45,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:45,939 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:42:45,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:45,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 14:42:45,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:46,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 14:42:46,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:46,043 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2023-02-14 14:42:46,043 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:46,085 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 49 states and 60 transitions. Complement of second has 7 states. [2023-02-14 14:42:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-14 14:42:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-02-14 14:42:46,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-14 14:42:46,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:46,086 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:42:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:46,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 14:42:46,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:46,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 14:42:46,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:46,191 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2023-02-14 14:42:46,191 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:46,248 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 48 states and 62 transitions. Complement of second has 6 states. [2023-02-14 14:42:46,248 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 [2023-02-14 14:42:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-14 14:42:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2023-02-14 14:42:46,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-14 14:42:46,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:46,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 21 letters. Loop has 3 letters. [2023-02-14 14:42:46,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:46,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 6 letters. [2023-02-14 14:42:46,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:46,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2023-02-14 14:42:46,251 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-14 14:42:46,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2023-02-14 14:42:46,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-02-14 14:42:46,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-02-14 14:42:46,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-02-14 14:42:46,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 14:42:46,251 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-14 14:42:46,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-14 14:42:46,251 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-14 14:42:46,251 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-14 14:42:46,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-02-14 14:42:46,251 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-14 14:42:46,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-02-14 14:42:46,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.02 02:42:46 BoogieIcfgContainer [2023-02-14 14:42:46,256 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-14 14:42:46,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 14:42:46,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 14:42:46,257 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 14:42:46,257 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:42:35" (3/4) ... [2023-02-14 14:42:46,259 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-14 14:42:46,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 14:42:46,259 INFO L158 Benchmark]: Toolchain (without parser) took 10884.36ms. Allocated memory was 134.2MB in the beginning and 230.7MB in the end (delta: 96.5MB). Free memory was 89.9MB in the beginning and 189.7MB in the end (delta: -99.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 14:42:46,259 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 14:42:46,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.64ms. Allocated memory is still 134.2MB. Free memory was 89.9MB in the beginning and 79.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 14:42:46,260 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.68ms. Allocated memory is still 134.2MB. Free memory was 79.9MB in the beginning and 78.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 14:42:46,260 INFO L158 Benchmark]: Boogie Preprocessor took 40.05ms. Allocated memory is still 134.2MB. Free memory was 78.1MB in the beginning and 76.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 14:42:46,260 INFO L158 Benchmark]: RCFGBuilder took 325.28ms. Allocated memory is still 134.2MB. Free memory was 76.5MB in the beginning and 105.4MB in the end (delta: -28.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2023-02-14 14:42:46,260 INFO L158 Benchmark]: BuchiAutomizer took 10309.94ms. Allocated memory was 134.2MB in the beginning and 230.7MB in the end (delta: 96.5MB). Free memory was 105.2MB in the beginning and 189.7MB in the end (delta: -84.4MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2023-02-14 14:42:46,260 INFO L158 Benchmark]: Witness Printer took 2.14ms. Allocated memory is still 230.7MB. Free memory is still 189.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 14:42:46,262 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.64ms. Allocated memory is still 134.2MB. Free memory was 89.9MB in the beginning and 79.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.68ms. Allocated memory is still 134.2MB. Free memory was 79.9MB in the beginning and 78.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.05ms. Allocated memory is still 134.2MB. Free memory was 78.1MB in the beginning and 76.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 325.28ms. Allocated memory is still 134.2MB. Free memory was 76.5MB in the beginning and 105.4MB in the end (delta: -28.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10309.94ms. Allocated memory was 134.2MB in the beginning and 230.7MB in the end (delta: 96.5MB). Free memory was 105.2MB in the beginning and 189.7MB in the end (delta: -84.4MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Witness Printer took 2.14ms. Allocated memory is still 230.7MB. Free memory is still 189.7MB. 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[build_nondet_String()] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 312 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 276 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 130 mSDtfsCounter, 276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital283 mio100 ax100 hnf100 lsp100 ukn74 mio100 lsp30 div167 bol100 ite100 ukn100 eq160 hnf93 smp71 dnf724 smp55 tf100 neg95 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 264ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-02-14 14:42:46,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:46,491 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