./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 6bebda7974b4ee09f480826bc3895f6f62b6e4c0586920bb97da4d140e226dad --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:21:39,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:21:39,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:21:39,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:21:39,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:21:39,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:21:39,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:21:39,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:21:39,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:21:39,977 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:21:39,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:21:39,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:21:39,978 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:21:39,979 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:21:39,981 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:21:39,982 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:21:39,982 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:21:39,982 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:21:39,982 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:21:39,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:21:39,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:21:39,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:21:39,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:21:39,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:21:39,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:21:39,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:21:39,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:21:39,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:21:39,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:21:39,987 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:21:39,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:21:39,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:21:39,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:21:39,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:21:39,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:21:39,992 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:21:39,993 INFO L153 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6bebda7974b4ee09f480826bc3895f6f62b6e4c0586920bb97da4d140e226dad [2024-10-12 00:21:40,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:21:40,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:21:40,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:21:40,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:21:40,261 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:21:40,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2024-10-12 00:21:41,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:21:42,017 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:21:42,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2024-10-12 00:21:42,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bac250c29/7786508fc44b4f8a94ae9a553064cead/FLAG51535e810 [2024-10-12 00:21:42,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bac250c29/7786508fc44b4f8a94ae9a553064cead [2024-10-12 00:21:42,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:21:42,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:21:42,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:21:42,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:21:42,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:21:42,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f8b166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42, skipping insertion in model container [2024-10-12 00:21:42,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:21:42,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:21:42,767 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:21:42,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:21:42,863 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:21:42,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42 WrapperNode [2024-10-12 00:21:42,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:21:42,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:21:42,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:21:42,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:21:42,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,913 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2024-10-12 00:21:42,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:21:42,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:21:42,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:21:42,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:21:42,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,943 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-10-12 00:21:42,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:21:42,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:21:42,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:21:42,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:21:42,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (1/1) ... [2024-10-12 00:21:42,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:43,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:43,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:21:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:21:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:21:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:21:43,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:21:43,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:21:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:21:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:21:43,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:21:43,139 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:21:43,141 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:21:43,333 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-12 00:21:43,333 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:21:43,352 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:21:43,353 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:21:43,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:21:43 BoogieIcfgContainer [2024-10-12 00:21:43,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:21:43,355 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:21:43,355 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:21:43,384 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:21:43,386 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:21:43,386 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:21:42" (1/3) ... [2024-10-12 00:21:43,388 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c71a7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:21:43, skipping insertion in model container [2024-10-12 00:21:43,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:21:43,388 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:21:42" (2/3) ... [2024-10-12 00:21:43,388 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c71a7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:21:43, skipping insertion in model container [2024-10-12 00:21:43,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:21:43,388 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:21:43" (3/3) ... [2024-10-12 00:21:43,391 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrcspn_diffterm_alloca.i [2024-10-12 00:21:43,444 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:21:43,444 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:21:43,444 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:21:43,444 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:21:43,445 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:21:43,446 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:21:43,446 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:21:43,446 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:21:43,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:43,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:21:43,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:43,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:43,476 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:21:43,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:21:43,477 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:21:43,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:43,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:21:43,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:43,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:43,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:21:43,480 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:21:43,488 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;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~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 16#L382true assume !(main_~length1~0#1 < 1); 14#L382-2true assume !(main_~length2~0#1 < 1); 3#L385-1true call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, 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; 7#L369-4true [2024-10-12 00:21:43,488 INFO L747 eck$LassoCheckResult]: Loop: 7#L369-4true call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 15#L369-1true assume !!(49 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 5#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 19#L374true assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1; 8#L369-3true cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, 1 + cstrcspn_#t~post212#1.offset;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset; 7#L369-4true [2024-10-12 00:21:43,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2024-10-12 00:21:43,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:43,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809873503] [2024-10-12 00:21:43,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:43,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:43,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:43,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:43,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2024-10-12 00:21:43,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:43,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325488584] [2024-10-12 00:21:43,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:43,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:43,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:21:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325488584] [2024-10-12 00:21:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325488584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:21:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:21:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:21:43,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388074473] [2024-10-12 00:21:43,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:21:43,816 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:21:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:21:43,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 00:21:43,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 00:21:43,856 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:21:43,863 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-10-12 00:21:43,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2024-10-12 00:21:43,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:21:43,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2024-10-12 00:21:43,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:21:43,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-12 00:21:43,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2024-10-12 00:21:43,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:21:43,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-12 00:21:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2024-10-12 00:21:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-12 00:21:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:43,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2024-10-12 00:21:43,899 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-12 00:21:43,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:21:43,906 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-12 00:21:43,906 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:21:43,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2024-10-12 00:21:43,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:21:43,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:43,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:43,908 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:21:43,908 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:43,908 INFO L745 eck$LassoCheckResult]: Stem: 55#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 50#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 51#L382 assume !(main_~length1~0#1 < 1); 56#L382-2 assume !(main_~length2~0#1 < 1); 44#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, 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; 45#L369-4 [2024-10-12 00:21:43,909 INFO L747 eck$LassoCheckResult]: Loop: 45#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 52#L369-1 assume !!(49 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 48#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 49 != cstrcspn_#t~mem207#1; 49#L372-1 assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1; 46#L372-6 call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 47#L374 assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1; 53#L369-3 cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, 1 + cstrcspn_#t~post212#1.offset;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset; 45#L369-4 [2024-10-12 00:21:43,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:43,911 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2024-10-12 00:21:43,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:43,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868455380] [2024-10-12 00:21:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:43,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:43,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:43,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:43,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:43,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2024-10-12 00:21:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:43,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090917725] [2024-10-12 00:21:43,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:43,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:44,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:44,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:44,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:44,035 INFO L85 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2024-10-12 00:21:44,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:44,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347138996] [2024-10-12 00:21:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:44,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:44,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:45,253 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:21:45,253 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:21:45,254 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:21:45,254 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:21:45,254 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:21:45,254 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:45,255 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:21:45,255 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:21:45,255 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration2_Lasso [2024-10-12 00:21:45,255 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:21:45,255 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:21:45,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:45,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:46,387 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:21:46,392 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:21:46,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:46,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:46,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:46,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:21:46,398 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 [2024-10-12 00:21:46,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:46,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:46,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:46,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:46,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:46,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:46,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:46,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:46,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:21:46,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:46,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:46,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:46,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:21:46,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:46,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:46,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:46,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:46,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:46,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:46,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:46,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:46,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:46,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:21:46,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:46,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:46,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:46,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:21:46,482 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 [2024-10-12 00:21:46,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:46,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:46,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:46,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:46,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:46,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:46,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:46,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:46,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:21:46,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:46,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:46,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:46,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:21:46,521 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 [2024-10-12 00:21:46,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:46,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:46,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:46,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:46,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:46,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:46,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:46,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:21:46,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:46,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:46,561 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:46,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:21:46,566 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 [2024-10-12 00:21:46,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:46,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:46,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:46,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:46,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:46,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:46,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:46,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:46,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:21:46,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:46,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:46,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:46,602 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 [2024-10-12 00:21:46,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:21:46,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:46,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:46,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:46,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:46,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:46,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:46,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:46,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:21:46,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:46,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:46,637 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:46,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:21:46,638 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 [2024-10-12 00:21:46,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:46,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:46,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:46,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:46,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:46,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:46,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:46,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:46,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:46,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:46,680 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:46,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:21:46,682 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 [2024-10-12 00:21:46,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:46,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:46,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:46,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:46,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:46,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:46,709 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:21:46,734 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-12 00:21:46,734 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-10-12 00:21:46,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:46,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:46,765 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:46,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:21:46,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:21:46,783 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:21:46,783 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:21:46,784 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215#1.base)_1, ULTIMATE.start_cstrcspn_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215#1.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset Supporting invariants [] [2024-10-12 00:21:46,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:21:46,856 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2024-10-12 00:21:46,865 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sc1~0!offset [2024-10-12 00:21:46,866 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:21:46,866 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:21:46,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:46,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:21:46,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:46,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:21:46,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:47,039 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 [2024-10-12 00:21:47,041 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:47,116 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 28 transitions. Complement of second has 4 states. [2024-10-12 00:21:47,118 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 [2024-10-12 00:21:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2024-10-12 00:21:47,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2024-10-12 00:21:47,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:47,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2024-10-12 00:21:47,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:47,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2024-10-12 00:21:47,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:47,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2024-10-12 00:21:47,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:21:47,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2024-10-12 00:21:47,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:21:47,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:21:47,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2024-10-12 00:21:47,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:21:47,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-10-12 00:21:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2024-10-12 00:21:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-12 00:21:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2024-10-12 00:21:47,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-10-12 00:21:47,131 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-10-12 00:21:47,131 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:21:47,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2024-10-12 00:21:47,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:21:47,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:47,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:47,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:47,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:21:47,132 INFO L745 eck$LassoCheckResult]: Stem: 213#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 205#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 206#L382 assume !(main_~length1~0#1 < 1); 214#L382-2 assume !(main_~length2~0#1 < 1); 197#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, 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; 198#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 208#L369-1 assume !!(49 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 201#L372-5 [2024-10-12 00:21:47,133 INFO L747 eck$LassoCheckResult]: Loop: 201#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 49 != cstrcspn_#t~mem207#1; 202#L372-1 assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 211#L372-3 assume !!cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post210#1.base, 1 + cstrcspn_#t~post210#1.offset; 201#L372-5 [2024-10-12 00:21:47,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:47,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2024-10-12 00:21:47,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:47,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577032929] [2024-10-12 00:21:47,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:47,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:47,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:47,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:47,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:47,206 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2024-10-12 00:21:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:47,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468774227] [2024-10-12 00:21:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:47,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:47,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:47,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:47,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2024-10-12 00:21:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:47,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580278800] [2024-10-12 00:21:47,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:47,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:47,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:47,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:47,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:21:48,146 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:21:48,146 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:21:48,146 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:21:48,147 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:21:48,147 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:21:48,147 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:48,147 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:21:48,147 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:21:48,147 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration3_Lasso [2024-10-12 00:21:48,147 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:21:48,147 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:21:48,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:48,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:49,086 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:21:49,089 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:21:49,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,091 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:21:49,094 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 [2024-10-12 00:21:49,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:49,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:49,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:49,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:49,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,125 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:21:49,127 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 [2024-10-12 00:21:49,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:49,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:49,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:49,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:21:49,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,151 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:21:49,153 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 [2024-10-12 00:21:49,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:49,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:49,168 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:49,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,181 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:21:49,183 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 [2024-10-12 00:21:49,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:49,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:49,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:49,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:49,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,207 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:21:49,209 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 [2024-10-12 00:21:49,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:49,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:49,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:49,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:21:49,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,234 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:21:49,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:49,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:49,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:49,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:49,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:49,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,260 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:21:49,262 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 [2024-10-12 00:21:49,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:49,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:49,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:49,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,289 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:21:49,291 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 [2024-10-12 00:21:49,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:49,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:49,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:49,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:21:49,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,315 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:21:49,317 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 [2024-10-12 00:21:49,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:49,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:49,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:49,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:21:49,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,350 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:21:49,352 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 [2024-10-12 00:21:49,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:49,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:49,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:49,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:49,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,379 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:21:49,381 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 [2024-10-12 00:21:49,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:49,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:49,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:49,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:49,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,406 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:21:49,408 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 [2024-10-12 00:21:49,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:49,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:49,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:49,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:49,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:21:49,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,432 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:21:49,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:49,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:49,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:49,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:49,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:49,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:49,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:49,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:21:49,498 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-10-12 00:21:49,498 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-12 00:21:49,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:49,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:49,499 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:49,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:21:49,500 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:21:49,512 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-12 00:21:49,512 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:21:49,512 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset) = -2*ULTIMATE.start_cstrcspn_~s~0#1.offset + 36893488147419103229 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_cstrcspn_~s2#1.base)_2 + 18446744073709551615 >= 0] [2024-10-12 00:21:49,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:21:49,565 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2024-10-12 00:21:49,570 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-12 00:21:49,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:49,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:21:49,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:49,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-10-12 00:21:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:49,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:21:49,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:49,718 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-12 00:21:49,719 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:49,768 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 46 transitions. Complement of second has 6 states. [2024-10-12 00:21:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:21:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-12 00:21:49,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2024-10-12 00:21:49,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:49,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2024-10-12 00:21:49,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:49,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2024-10-12 00:21:49,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:49,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2024-10-12 00:21:49,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:21:49,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 25 states and 34 transitions. [2024-10-12 00:21:49,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:21:49,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:21:49,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2024-10-12 00:21:49,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:21:49,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-12 00:21:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2024-10-12 00:21:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-12 00:21:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2024-10-12 00:21:49,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions. [2024-10-12 00:21:49,778 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2024-10-12 00:21:49,778 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:21:49,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2024-10-12 00:21:49,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:21:49,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:49,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:49,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:49,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:21:49,781 INFO L745 eck$LassoCheckResult]: Stem: 380#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 371#L382 assume !(main_~length1~0#1 < 1); 381#L382-2 assume !(main_~length2~0#1 < 1); 362#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, 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; 363#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 372#L369-1 assume !!(49 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 383#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 49 != cstrcspn_#t~mem207#1; 378#L372-1 assume !cstrcspn_#t~short209#1; 379#L372-3 assume !cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1; 364#L372-6 call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 365#L374 assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1; 376#L369-3 cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, 1 + cstrcspn_#t~post212#1.offset;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset; 373#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 374#L369-1 assume !!(49 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 366#L372-5 [2024-10-12 00:21:49,782 INFO L747 eck$LassoCheckResult]: Loop: 366#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 49 != cstrcspn_#t~mem207#1; 367#L372-1 assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 377#L372-3 assume !!cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post210#1.base, 1 + cstrcspn_#t~post210#1.offset; 366#L372-5 [2024-10-12 00:21:49,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2024-10-12 00:21:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:49,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824785721] [2024-10-12 00:21:49,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:49,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:49,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:49,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2024-10-12 00:21:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355369608] [2024-10-12 00:21:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:49,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:49,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:49,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2024-10-12 00:21:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:49,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870346607] [2024-10-12 00:21:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:49,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:21:50,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870346607] [2024-10-12 00:21:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870346607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:21:50,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899033871] [2024-10-12 00:21:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:50,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:21:50,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:50,125 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:21:50,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-12 00:21:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:50,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-12 00:21:50,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:50,221 INFO L378 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 8 treesize of output 1 [2024-10-12 00:21:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:50,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:21:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:50,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899033871] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:21:50,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:21:50,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2024-10-12 00:21:50,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641353897] [2024-10-12 00:21:50,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:21:50,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:21:50,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 00:21:50,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-10-12 00:21:50,550 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:21:50,684 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-10-12 00:21:50,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2024-10-12 00:21:50,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:21:50,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 38 states and 47 transitions. [2024-10-12 00:21:50,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:21:50,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-12 00:21:50,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 47 transitions. [2024-10-12 00:21:50,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:21:50,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-12 00:21:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 47 transitions. [2024-10-12 00:21:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2024-10-12 00:21:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-12 00:21:50,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-12 00:21:50,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:21:50,692 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-12 00:21:50,692 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:21:50,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2024-10-12 00:21:50,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:21:50,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:50,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:50,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:50,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:21:50,693 INFO L745 eck$LassoCheckResult]: Stem: 589#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 579#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 580#L382 assume !(main_~length1~0#1 < 1); 590#L382-2 assume !(main_~length2~0#1 < 1); 571#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int#0(49, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(49, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem205#1, cstrcspn_#t~mem206#1, cstrcspn_#t~mem207#1, cstrcspn_#t~mem208#1, cstrcspn_#t~short209#1, cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset, cstrcspn_#t~mem211#1, cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset, 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; 572#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 581#L369-1 assume !!(49 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 595#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 49 != cstrcspn_#t~mem207#1; 587#L372-1 assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 588#L372-3 assume !cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1; 573#L372-6 call cstrcspn_#t~mem211#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 574#L374 assume !(cstrcspn_#t~mem211#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem211#1; 585#L369-3 cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post212#1.base, 1 + cstrcspn_#t~post212#1.offset;havoc cstrcspn_#t~post212#1.base, cstrcspn_#t~post212#1.offset; 582#L369-4 call cstrcspn_#t~mem205#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 583#L369-1 assume !!(49 != cstrcspn_#t~mem205#1);havoc cstrcspn_#t~mem205#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem206#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem206#1;havoc cstrcspn_#t~mem206#1; 575#L372-5 [2024-10-12 00:21:50,693 INFO L747 eck$LassoCheckResult]: Loop: 575#L372-5 call cstrcspn_#t~mem207#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := 49 != cstrcspn_#t~mem207#1; 576#L372-1 assume cstrcspn_#t~short209#1;call cstrcspn_#t~mem208#1 := read~int#1(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short209#1 := cstrcspn_#t~mem208#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 586#L372-3 assume !!cstrcspn_#t~short209#1;havoc cstrcspn_#t~mem207#1;havoc cstrcspn_#t~mem208#1;havoc cstrcspn_#t~short209#1;cstrcspn_#t~post210#1.base, cstrcspn_#t~post210#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post210#1.base, 1 + cstrcspn_#t~post210#1.offset; 575#L372-5 [2024-10-12 00:21:50,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:50,694 INFO L85 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2024-10-12 00:21:50,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:50,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333888347] [2024-10-12 00:21:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:50,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:50,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:50,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:50,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2024-10-12 00:21:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:50,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639215320] [2024-10-12 00:21:50,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:50,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:50,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:50,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:50,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2024-10-12 00:21:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:50,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865117813] [2024-10-12 00:21:50,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:50,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:50,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:50,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:51,842 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:21:51,843 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:21:51,843 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:21:51,843 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:21:51,843 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:21:51,843 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:51,843 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:21:51,843 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:21:51,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration5_Lasso [2024-10-12 00:21:51,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:21:51,843 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:21:51,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:51,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:51,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:51,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:51,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:51,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:51,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:51,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:51,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:52,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:53,243 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:21:53,244 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:21:53,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,246 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:21:53,252 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 [2024-10-12 00:21:53,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:53,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:53,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:53,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-12 00:21:53,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,282 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:21:53,283 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 [2024-10-12 00:21:53,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:53,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:53,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:53,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:53,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,309 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:21:53,311 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 [2024-10-12 00:21:53,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:53,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:53,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:53,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:53,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,337 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:21:53,338 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 [2024-10-12 00:21:53,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:53,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:53,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:53,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-12 00:21:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,363 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:21:53,366 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 [2024-10-12 00:21:53,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:53,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:53,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:53,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:53,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,402 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:21:53,405 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 [2024-10-12 00:21:53,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:53,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:53,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:53,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:53,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,439 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:21:53,441 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 [2024-10-12 00:21:53,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:53,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:53,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:53,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-12 00:21:53,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,465 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:21:53,466 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 [2024-10-12 00:21:53,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:53,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:53,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:53,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-12 00:21:53,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,490 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:21:53,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:53,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:53,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:53,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:21:53,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,525 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:21:53,527 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 [2024-10-12 00:21:53,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:53,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:53,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:21:53,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,560 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:21:53,562 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 [2024-10-12 00:21:53,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:53,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:53,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:53,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,598 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:21:53,601 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 [2024-10-12 00:21:53,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:53,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:53,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:53,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:53,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,634 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:21:53,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 [2024-10-12 00:21:53,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:53,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:53,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:53,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:53,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:53,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:53,667 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:21:53,683 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-12 00:21:53,683 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:21:53,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:53,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:53,686 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:53,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:21:53,687 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:21:53,698 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:21:53,698 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:21:53,698 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_3, ULTIMATE.start_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2024-10-12 00:21:53,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-12 00:21:53,734 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-10-12 00:21:53,737 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-12 00:21:53,737 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:21:53,737 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:21:53,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:53,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:21:53,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:53,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:21:53,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:53,861 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-12 00:21:53,861 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:53,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 47 transitions. Complement of second has 6 states. [2024-10-12 00:21:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:21:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-12 00:21:53,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 15 letters. Loop has 3 letters. [2024-10-12 00:21:53,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:53,908 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:21:53,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:53,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:21:53,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:54,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:21:54,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:54,039 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-12 00:21:54,039 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:54,082 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 47 transitions. Complement of second has 6 states. [2024-10-12 00:21:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:21:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-12 00:21:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 15 letters. Loop has 3 letters. [2024-10-12 00:21:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:54,083 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:21:54,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:54,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:21:54,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:54,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:21:54,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:54,210 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-12 00:21:54,210 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:54,251 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 55 transitions. Complement of second has 5 states. [2024-10-12 00:21:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:21:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-10-12 00:21:54,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 15 letters. Loop has 3 letters. [2024-10-12 00:21:54,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:54,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 3 letters. [2024-10-12 00:21:54,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:54,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 15 letters. Loop has 6 letters. [2024-10-12 00:21:54,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:54,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 55 transitions. [2024-10-12 00:21:54,256 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:21:54,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2024-10-12 00:21:54,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:21:54,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:21:54,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:21:54,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:21:54,257 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:21:54,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:21:54,257 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:21:54,257 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:21:54,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:21:54,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:21:54,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:21:54,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:21:54 BoogieIcfgContainer [2024-10-12 00:21:54,268 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:21:54,268 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:21:54,268 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:21:54,268 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:21:54,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:21:43" (3/4) ... [2024-10-12 00:21:54,271 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:21:54,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:21:54,273 INFO L158 Benchmark]: Toolchain (without parser) took 11915.12ms. Allocated memory was 163.6MB in the beginning and 262.1MB in the end (delta: 98.6MB). Free memory was 108.3MB in the beginning and 165.8MB in the end (delta: -57.5MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2024-10-12 00:21:54,273 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 163.6MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:21:54,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.77ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 87.8MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 00:21:54,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.03ms. Allocated memory is still 163.6MB. Free memory was 87.8MB in the beginning and 86.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:21:54,274 INFO L158 Benchmark]: Boogie Preprocessor took 45.09ms. Allocated memory is still 163.6MB. Free memory was 85.7MB in the beginning and 83.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:21:54,274 INFO L158 Benchmark]: RCFGBuilder took 387.50ms. Allocated memory is still 163.6MB. Free memory was 83.6MB in the beginning and 131.4MB in the end (delta: -47.8MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-12 00:21:54,277 INFO L158 Benchmark]: BuchiAutomizer took 10912.84ms. Allocated memory was 163.6MB in the beginning and 262.1MB in the end (delta: 98.6MB). Free memory was 131.4MB in the beginning and 165.8MB in the end (delta: -34.4MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-10-12 00:21:54,277 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 262.1MB. Free memory is still 165.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:21:54,278 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 163.6MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.77ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 87.8MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.03ms. Allocated memory is still 163.6MB. Free memory was 87.8MB in the beginning and 86.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.09ms. Allocated memory is still 163.6MB. Free memory was 85.7MB in the beginning and 83.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 387.50ms. Allocated memory is still 163.6MB. Free memory was 83.6MB in the beginning and 131.4MB in the end (delta: -47.8MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 10912.84ms. Allocated memory was 163.6MB in the beginning and 262.1MB in the end (delta: 98.6MB). Free memory was 131.4MB in the beginning and 165.8MB in the end (delta: -34.4MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 262.1MB. Free memory is still 165.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sc1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 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, 126 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 95 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital277 mio100 ax100 hnf100 lsp110 ukn61 mio100 lsp31 div151 bol100 ite100 ukn100 eq154 hnf97 smp69 dnf1100 smp32 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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! [2024-10-12 00:21:54,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:54,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:54,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE