./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/cstrspn_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/cstrspn_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 0942d3c46657b9d8ac8f8537aec24fbcc2f0b19e897472dc297ad201df07c1bb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:22:00,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:22:01,035 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:22:01,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:22:01,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:22:01,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:22:01,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:22:01,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:22:01,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:22:01,084 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:22:01,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:22:01,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:22:01,085 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:22:01,086 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:22:01,086 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:22:01,086 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:22:01,086 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:22:01,087 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:22:01,087 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:22:01,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:22:01,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:22:01,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:22:01,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:22:01,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:22:01,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:22:01,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:22:01,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:22:01,090 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:22:01,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:22:01,090 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:22:01,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:22:01,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:22:01,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:22:01,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:22:01,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:22:01,099 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:22:01,099 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 -> 0942d3c46657b9d8ac8f8537aec24fbcc2f0b19e897472dc297ad201df07c1bb [2024-10-12 00:22:01,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:22:01,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:22:01,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:22:01,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:22:01,400 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:22:01,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i [2024-10-12 00:22:03,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:22:03,396 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:22:03,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i [2024-10-12 00:22:03,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f3c877884/3848fe46f668405fbb009adda1870d3f/FLAGc78ceff5d [2024-10-12 00:22:03,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f3c877884/3848fe46f668405fbb009adda1870d3f [2024-10-12 00:22:03,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:22:03,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:22:03,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:22:03,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:22:03,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:22:03,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:22:03" (1/1) ... [2024-10-12 00:22:03,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f68134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:03, skipping insertion in model container [2024-10-12 00:22:03,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:22:03" (1/1) ... [2024-10-12 00:22:03,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:22:04,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:22:04,101 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:22:04,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:22:04,202 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:22:04,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04 WrapperNode [2024-10-12 00:22:04,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:22:04,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:22:04,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:22:04,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:22:04,210 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:22:04" (1/1) ... [2024-10-12 00:22:04,224 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:22:04" (1/1) ... [2024-10-12 00:22:04,250 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2024-10-12 00:22:04,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:22:04,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:22:04,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:22:04,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:22:04,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04" (1/1) ... [2024-10-12 00:22:04,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04" (1/1) ... [2024-10-12 00:22:04,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04" (1/1) ... [2024-10-12 00:22:04,287 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:22:04,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04" (1/1) ... [2024-10-12 00:22:04,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04" (1/1) ... [2024-10-12 00:22:04,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04" (1/1) ... [2024-10-12 00:22:04,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04" (1/1) ... [2024-10-12 00:22:04,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04" (1/1) ... [2024-10-12 00:22:04,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04" (1/1) ... [2024-10-12 00:22:04,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:22:04,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:22:04,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:22:04,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:22:04,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04" (1/1) ... [2024-10-12 00:22:04,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:04,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:04,355 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:22:04,359 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:22:04,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:22:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:22:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:22:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:22:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:22:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:22:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:22:04,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:22:04,509 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:22:04,513 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:22:04,851 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-12 00:22:04,851 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:22:04,866 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:22:04,866 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:22:04,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:22:04 BoogieIcfgContainer [2024-10-12 00:22:04,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:22:04,868 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:22:04,869 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:22:04,872 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:22:04,875 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:22:04,875 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:22:03" (1/3) ... [2024-10-12 00:22:04,876 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a4ea99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:22:04, skipping insertion in model container [2024-10-12 00:22:04,877 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:22:04,877 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:04" (2/3) ... [2024-10-12 00:22:04,877 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a4ea99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:22:04, skipping insertion in model container [2024-10-12 00:22:04,877 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:22:04,877 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:22:04" (3/3) ... [2024-10-12 00:22:04,879 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrspn_diffterm_alloca.i [2024-10-12 00:22:04,931 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:22:04,931 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:22:04,931 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:22:04,931 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:22:04,931 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:22:04,932 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:22:04,932 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:22:04,932 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:22:04,936 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:22:04,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:22:04,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:04,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:04,959 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:22:04,960 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:22:04,960 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:22:04,960 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:22:04,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:22:04,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:04,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:04,962 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:22:04,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:22:04,970 INFO L745 eck$LassoCheckResult]: Stem: 13#$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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem205#1, cstrspn_#t~mem206#1, cstrspn_#t~mem207#1, cstrspn_#t~mem208#1, cstrspn_#t~short209#1, cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset, cstrspn_#t~mem211#1, cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 8#L369-4true [2024-10-12 00:22:04,971 INFO L747 eck$LassoCheckResult]: Loop: 8#L369-4true call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 15#L369-1true assume !!(49 != cstrspn_#t~mem205#1);havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1; 5#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem211#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 19#L374true assume !(cstrspn_#t~mem211#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem211#1; 9#L369-3true cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post212#1.base, 1 + cstrspn_#t~post212#1.offset;havoc cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset; 8#L369-4true [2024-10-12 00:22:04,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:04,977 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2024-10-12 00:22:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:04,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51129008] [2024-10-12 00:22:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:04,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:05,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:05,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:05,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2024-10-12 00:22:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:05,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481717541] [2024-10-12 00:22:05,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:05,243 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:22:05,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:05,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481717541] [2024-10-12 00:22:05,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481717541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:22:05,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:22:05,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:22:05,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649333081] [2024-10-12 00:22:05,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:22:05,248 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:22:05,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:05,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 00:22:05,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 00:22:05,290 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:22:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:05,298 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-10-12 00:22:05,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2024-10-12 00:22:05,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:22:05,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2024-10-12 00:22:05,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:22:05,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-12 00:22:05,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2024-10-12 00:22:05,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:05,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-12 00:22:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2024-10-12 00:22:05,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-12 00:22:05,331 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:22:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2024-10-12 00:22:05,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-12 00:22:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:22:05,337 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-12 00:22:05,339 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:22:05,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2024-10-12 00:22:05,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:22:05,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:05,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:05,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:22:05,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:22:05,342 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem205#1, cstrspn_#t~mem206#1, cstrspn_#t~mem207#1, cstrspn_#t~mem208#1, cstrspn_#t~short209#1, cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset, cstrspn_#t~mem211#1, cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 45#L369-4 [2024-10-12 00:22:05,343 INFO L747 eck$LassoCheckResult]: Loop: 45#L369-4 call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 52#L369-1 assume !!(49 != cstrspn_#t~mem205#1);havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1; 48#L372-5 call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 49 != cstrspn_#t~mem207#1; 49#L372-1 assume cstrspn_#t~short209#1;call cstrspn_#t~mem208#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := cstrspn_#t~mem208#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1; 46#L372-6 call cstrspn_#t~mem211#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 47#L374 assume !(cstrspn_#t~mem211#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem211#1; 53#L369-3 cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post212#1.base, 1 + cstrspn_#t~post212#1.offset;havoc cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset; 45#L369-4 [2024-10-12 00:22:05,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2024-10-12 00:22:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:05,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060485843] [2024-10-12 00:22:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:05,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:05,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:05,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:05,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:05,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2024-10-12 00:22:05,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:05,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973822078] [2024-10-12 00:22:05,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:05,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:05,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:05,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:05,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2024-10-12 00:22:05,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:05,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831275390] [2024-10-12 00:22:05,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:05,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:05,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:06,514 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:22:06,515 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:22:06,516 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:22:06,516 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:22:06,516 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:22:06,516 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:06,516 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:22:06,516 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:22:06,516 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca.i_Iteration2_Lasso [2024-10-12 00:22:06,516 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:22:06,517 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:22:06,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:06,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:07,354 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:22:07,362 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:22:07,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,366 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:22:07,368 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:22:07,371 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:22:07,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:07,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:07,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:07,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,408 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:22:07,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,411 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:22:07,413 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:22:07,414 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:22:07,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:07,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:07,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:07,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,447 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:22:07,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,450 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:22:07,452 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:22:07,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:07,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:07,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:07,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:07,469 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,485 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:22:07,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,488 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:22:07,489 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:22:07,490 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:22:07,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:07,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:07,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:07,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,522 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:22:07,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,525 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:22:07,527 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:22:07,529 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:22:07,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:07,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:07,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:07,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,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:22:07,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,602 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:22:07,607 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:22:07,608 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:22:07,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:07,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:07,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:07,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,649 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:22:07,650 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:22:07,652 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:22:07,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:07,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:07,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:07,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:22:07,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,684 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:22:07,685 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:22:07,687 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:22:07,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:07,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:07,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:07,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,715 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:22:07,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,717 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:22:07,718 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:22:07,721 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:22:07,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:07,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:07,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:07,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:07,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,757 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:22:07,758 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:22:07,759 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:22:07,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:07,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:07,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:07,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:22:07,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,794 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:22:07,801 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:22:07,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:07,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:07,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:07,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:07,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,847 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:22:07,848 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:22:07,849 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:22:07,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:07,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,862 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-10-12 00:22:07,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:07,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:07,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:22:07,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,895 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:22:07,896 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:22:07,897 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:22:07,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:07,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:07,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:07,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:22:07,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,944 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:22:07,945 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:22:07,947 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:22:07,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:07,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:07,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:07,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:07,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:07,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:07,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:22:07,993 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-12 00:22:07,994 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:22:07,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:07,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:07,997 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:22:08,003 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:22:08,004 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:22:08,020 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:22:08,021 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:22:08,021 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0#1.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0#1.base)_1 Supporting invariants [] [2024-10-12 00:22:08,038 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:22:08,079 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2024-10-12 00:22:08,092 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:22:08,096 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:22:08,098 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sc1~0!offset [2024-10-12 00:22:08,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:08,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:22:08,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:08,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:22:08,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:08,243 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:22:08,247 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:22:08,248 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:22:08,290 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:22:08,291 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:22:08,291 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:22:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2024-10-12 00:22:08,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2024-10-12 00:22:08,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:08,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2024-10-12 00:22:08,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:08,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2024-10-12 00:22:08,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:08,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2024-10-12 00:22:08,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:22:08,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2024-10-12 00:22:08,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:22:08,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:22:08,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2024-10-12 00:22:08,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:22:08,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-10-12 00:22:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2024-10-12 00:22:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-12 00:22:08,297 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:22:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2024-10-12 00:22:08,298 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-10-12 00:22:08,298 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-10-12 00:22:08,298 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:22:08,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2024-10-12 00:22:08,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:22:08,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:08,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:08,299 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:22:08,299 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:08,299 INFO L745 eck$LassoCheckResult]: Stem: 192#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 184#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; 185#L382 assume !(main_~length1~0#1 < 1); 193#L382-2 assume !(main_~length2~0#1 < 1); 176#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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem205#1, cstrspn_#t~mem206#1, cstrspn_#t~mem207#1, cstrspn_#t~mem208#1, cstrspn_#t~short209#1, cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset, cstrspn_#t~mem211#1, cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 177#L369-4 call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 186#L369-1 assume !!(49 != cstrspn_#t~mem205#1);havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1; 180#L372-5 [2024-10-12 00:22:08,299 INFO L747 eck$LassoCheckResult]: Loop: 180#L372-5 call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 49 != cstrspn_#t~mem207#1; 181#L372-1 assume cstrspn_#t~short209#1;call cstrspn_#t~mem208#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := cstrspn_#t~mem208#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 190#L372-3 assume !!cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1;cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post210#1.base, 1 + cstrspn_#t~post210#1.offset; 180#L372-5 [2024-10-12 00:22:08,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2024-10-12 00:22:08,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:08,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232447345] [2024-10-12 00:22:08,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:08,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:08,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:08,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:08,334 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2024-10-12 00:22:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990540981] [2024-10-12 00:22:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:08,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:08,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:08,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2024-10-12 00:22:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:08,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501695436] [2024-10-12 00:22:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:08,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:08,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:09,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:22:09,319 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:22:09,320 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:22:09,320 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:22:09,320 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:22:09,320 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:22:09,320 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:09,320 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:22:09,321 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:22:09,321 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca.i_Iteration3_Lasso [2024-10-12 00:22:09,321 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:22:09,321 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:22:09,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:09,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:10,139 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:22:10,139 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:22:10,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:10,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:10,142 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:22:10,143 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:22:10,144 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:22:10,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:10,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:10,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:10,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:10,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:10,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:10,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:10,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:10,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:22:10,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:10,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:10,174 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:22:10,175 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:22:10,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:10,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:10,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:10,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:10,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:10,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:10,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:10,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:10,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:10,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:10,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:10,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:10,206 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:22:10,207 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:22:10,208 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:22:10,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:10,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:10,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:10,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:10,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:10,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:10,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:10,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:10,235 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:22:10,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:10,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:10,237 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:22:10,239 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:22:10,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:10,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:10,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:10,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:10,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:10,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:10,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:10,257 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:10,273 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:22:10,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:10,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:10,275 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:22:10,277 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:22:10,278 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:22:10,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:10,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:10,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:10,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:10,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:10,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:10,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:10,321 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:22:10,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:10,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:10,324 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:22:10,325 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:22:10,326 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:22:10,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:10,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:10,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:10,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:10,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:10,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:10,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:10,360 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:22:10,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:10,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:10,362 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:22:10,363 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:22:10,364 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:22:10,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:10,377 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-12 00:22:10,377 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2024-10-12 00:22:10,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:10,438 INFO L401 nArgumentSynthesizer]: We have 140 Motzkin's Theorem applications. [2024-10-12 00:22:10,438 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2024-10-12 00:22:10,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:10,588 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:22:10,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:10,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:10,591 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:22:10,593 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:22:10,593 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:22:10,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:10,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:10,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:10,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:10,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:10,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:10,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:10,624 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:22:10,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:10,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:10,628 INFO L229 MonitoredProcess]: Starting monitored process 25 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:22:10,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:22:10,653 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:22:10,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:10,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:10,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:10,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:10,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:10,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:10,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:10,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:10,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:10,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:10,686 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:22:10,687 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:22:10,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:10,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:10,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:10,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:10,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:10,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:10,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:10,713 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:22:10,728 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-12 00:22:10,728 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-10-12 00:22:10,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:10,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:10,731 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:22:10,742 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:22:10,743 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:22:10,758 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:22:10,758 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:22:10,758 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_2, ULTIMATE.start_cstrspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216#1.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0#1.offset Supporting invariants [] [2024-10-12 00:22:10,776 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:22:10,796 INFO L156 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2024-10-12 00:22:10,800 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:22:10,800 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:22:10,800 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-12 00:22:10,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:10,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:22:10,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:10,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:22:10,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:10,894 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:22:10,895 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:22:10,896 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:22:10,933 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:22:10,934 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:22:10,934 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:22:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-12 00:22:10,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2024-10-12 00:22:10,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:10,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2024-10-12 00:22:10,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:10,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2024-10-12 00:22:10,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:10,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2024-10-12 00:22:10,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:22:10,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 25 states and 34 transitions. [2024-10-12 00:22:10,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:22:10,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:22:10,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2024-10-12 00:22:10,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:22:10,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-12 00:22:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2024-10-12 00:22:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-12 00:22:10,939 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:22:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2024-10-12 00:22:10,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions. [2024-10-12 00:22:10,939 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2024-10-12 00:22:10,939 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:22:10,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2024-10-12 00:22:10,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:22:10,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:10,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:10,941 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:22:10,941 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:10,941 INFO L745 eck$LassoCheckResult]: Stem: 339#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 329#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; 330#L382 assume !(main_~length1~0#1 < 1); 340#L382-2 assume !(main_~length2~0#1 < 1); 321#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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem205#1, cstrspn_#t~mem206#1, cstrspn_#t~mem207#1, cstrspn_#t~mem208#1, cstrspn_#t~short209#1, cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset, cstrspn_#t~mem211#1, cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 322#L369-4 call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 331#L369-1 assume !!(49 != cstrspn_#t~mem205#1);havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1; 342#L372-5 call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 49 != cstrspn_#t~mem207#1; 337#L372-1 assume !cstrspn_#t~short209#1; 338#L372-3 assume !cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1; 323#L372-6 call cstrspn_#t~mem211#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 324#L374 assume !(cstrspn_#t~mem211#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem211#1; 335#L369-3 cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post212#1.base, 1 + cstrspn_#t~post212#1.offset;havoc cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset; 332#L369-4 call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 333#L369-1 assume !!(49 != cstrspn_#t~mem205#1);havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1; 325#L372-5 [2024-10-12 00:22:10,942 INFO L747 eck$LassoCheckResult]: Loop: 325#L372-5 call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 49 != cstrspn_#t~mem207#1; 326#L372-1 assume cstrspn_#t~short209#1;call cstrspn_#t~mem208#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := cstrspn_#t~mem208#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 336#L372-3 assume !!cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1;cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post210#1.base, 1 + cstrspn_#t~post210#1.offset; 325#L372-5 [2024-10-12 00:22:10,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2024-10-12 00:22:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:10,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814813614] [2024-10-12 00:22:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:11,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:11,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814813614] [2024-10-12 00:22:11,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814813614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:22:11,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:22:11,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 00:22:11,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285136810] [2024-10-12 00:22:11,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:22:11,060 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:11,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:11,060 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2024-10-12 00:22:11,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:11,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688092674] [2024-10-12 00:22:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:11,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:11,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:11,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:11,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:11,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:22:11,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:22:11,170 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:11,218 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-10-12 00:22:11,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2024-10-12 00:22:11,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:22:11,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2024-10-12 00:22:11,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-12 00:22:11,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:22:11,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2024-10-12 00:22:11,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:22:11,220 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-12 00:22:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2024-10-12 00:22:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-10-12 00:22:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-10-12 00:22:11,222 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-10-12 00:22:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:22:11,223 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-10-12 00:22:11,223 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:22:11,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2024-10-12 00:22:11,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:22:11,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:11,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:11,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:22:11,224 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:11,224 INFO L745 eck$LassoCheckResult]: Stem: 409#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 399#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; 400#L382 assume !(main_~length1~0#1 < 1); 410#L382-2 assume !(main_~length2~0#1 < 1); 391#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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrspn_#res#1;havoc cstrspn_#t~mem205#1, cstrspn_#t~mem206#1, cstrspn_#t~mem207#1, cstrspn_#t~mem208#1, cstrspn_#t~short209#1, cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset, cstrspn_#t~mem211#1, cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 392#L369-4 call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 401#L369-1 assume !!(49 != cstrspn_#t~mem205#1);havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1; 414#L372-5 call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 49 != cstrspn_#t~mem207#1; 413#L372-1 assume cstrspn_#t~short209#1;call cstrspn_#t~mem208#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := cstrspn_#t~mem208#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 412#L372-3 assume !cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1; 393#L372-6 call cstrspn_#t~mem211#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 394#L374 assume !(cstrspn_#t~mem211#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem211#1; 405#L369-3 cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post212#1.base, 1 + cstrspn_#t~post212#1.offset;havoc cstrspn_#t~post212#1.base, cstrspn_#t~post212#1.offset; 402#L369-4 call cstrspn_#t~mem205#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 403#L369-1 assume !!(49 != cstrspn_#t~mem205#1);havoc cstrspn_#t~mem205#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem206#1 := read~int#0(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem206#1;havoc cstrspn_#t~mem206#1; 395#L372-5 [2024-10-12 00:22:11,224 INFO L747 eck$LassoCheckResult]: Loop: 395#L372-5 call cstrspn_#t~mem207#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := 49 != cstrspn_#t~mem207#1; 396#L372-1 assume cstrspn_#t~short209#1;call cstrspn_#t~mem208#1 := read~int#1(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short209#1 := cstrspn_#t~mem208#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 406#L372-3 assume !!cstrspn_#t~short209#1;havoc cstrspn_#t~mem207#1;havoc cstrspn_#t~mem208#1;havoc cstrspn_#t~short209#1;cstrspn_#t~post210#1.base, cstrspn_#t~post210#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post210#1.base, 1 + cstrspn_#t~post210#1.offset; 395#L372-5 [2024-10-12 00:22:11,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:11,225 INFO L85 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2024-10-12 00:22:11,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:11,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107507633] [2024-10-12 00:22:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:11,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:11,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:11,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2024-10-12 00:22:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:11,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745058227] [2024-10-12 00:22:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:11,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:11,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:11,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:11,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:11,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2024-10-12 00:22:11,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:11,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959205731] [2024-10-12 00:22:11,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:11,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:11,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:11,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:12,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-12 00:22:12,391 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:22:12,391 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:22:12,391 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:22:12,391 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:22:12,391 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:22:12,391 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:12,391 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:22:12,391 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:22:12,392 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrspn_diffterm_alloca.i_Iteration5_Lasso [2024-10-12 00:22:12,392 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:22:12,392 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:22:12,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:12,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:13,693 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:22:13,693 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:22:13,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:13,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:13,695 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:22:13,696 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:22:13,697 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:22:13,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:13,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:13,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:13,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:13,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:13,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:13,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:13,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:13,726 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:22:13,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:13,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:13,728 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:22:13,731 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:22:13,731 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:22:13,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:13,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:13,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:13,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:13,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:13,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:13,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:13,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:13,759 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:22:13,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:13,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:13,762 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:22:13,763 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:22:13,763 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:22:13,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:13,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:13,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:13,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:13,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:13,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:13,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:13,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:13,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-12 00:22:13,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:13,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:13,793 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:22:13,795 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:22:13,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:13,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:13,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:13,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:13,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:13,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:13,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:13,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:13,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:13,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-12 00:22:13,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:13,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:13,829 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:22:13,829 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:22:13,831 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:22:13,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:13,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:13,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:13,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:13,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:13,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:13,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:13,844 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:13,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:13,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:13,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:13,861 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:22:13,862 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:22:13,863 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:22:13,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:13,875 INFO L203 nArgumentSynthesizer]: 6 stem disjuncts [2024-10-12 00:22:13,876 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2024-10-12 00:22:13,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:13,973 INFO L401 nArgumentSynthesizer]: We have 196 Motzkin's Theorem applications. [2024-10-12 00:22:13,973 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2024-10-12 00:22:14,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:14,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:14,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:14,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:14,225 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:22:14,227 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:22:14,228 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:22:14,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:14,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:14,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:14,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:14,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:14,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:14,258 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:22:14,315 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-10-12 00:22:14,315 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:22:14,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:14,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:14,317 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:22:14,318 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:22:14,319 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:22:14,332 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:22:14,333 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:22:14,333 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_cstrspn_~s~0#1.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0#1.base)_2 Supporting invariants [] [2024-10-12 00:22:14,348 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:22:14,376 INFO L156 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2024-10-12 00:22:14,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:22:14,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:22:14,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-12 00:22:14,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:14,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:22:14,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:14,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:22:14,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:14,491 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:22:14,492 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:22:14,492 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:14,524 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 40 transitions. Complement of second has 5 states. [2024-10-12 00:22:14,529 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:22:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-10-12 00:22:14,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 15 letters. Loop has 3 letters. [2024-10-12 00:22:14,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:14,531 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:22:14,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:14,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:22:14,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:14,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:22:14,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:14,636 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:22:14,637 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:22:14,637 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:14,666 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 40 transitions. Complement of second has 5 states. [2024-10-12 00:22:14,670 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:22:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-10-12 00:22:14,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 15 letters. Loop has 3 letters. [2024-10-12 00:22:14,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:14,671 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:22:14,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:14,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:22:14,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:14,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:22:14,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:14,784 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:22:14,785 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:22:14,785 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:14,827 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 48 transitions. Complement of second has 4 states. [2024-10-12 00:22:14,827 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:22:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2024-10-12 00:22:14,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 15 letters. Loop has 3 letters. [2024-10-12 00:22:14,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:14,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 18 letters. Loop has 3 letters. [2024-10-12 00:22:14,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:14,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 15 letters. Loop has 6 letters. [2024-10-12 00:22:14,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:14,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 48 transitions. [2024-10-12 00:22:14,831 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:22:14,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2024-10-12 00:22:14,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:22:14,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:22:14,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:22:14,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:14,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:22:14,843 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:22:14,843 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:22:14,843 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:22:14,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:22:14,843 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:22:14,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:22:14,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:22:14 BoogieIcfgContainer [2024-10-12 00:22:14,855 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:22:14,855 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:22:14,855 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:22:14,856 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:22:14,861 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:22:04" (3/4) ... [2024-10-12 00:22:14,863 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:22:14,864 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:22:14,867 INFO L158 Benchmark]: Toolchain (without parser) took 11138.91ms. Allocated memory was 226.5MB in the beginning and 308.3MB in the end (delta: 81.8MB). Free memory was 156.5MB in the beginning and 145.3MB in the end (delta: 11.3MB). Peak memory consumption was 95.5MB. Max. memory is 16.1GB. [2024-10-12 00:22:14,868 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 140.5MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:22:14,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.98ms. Allocated memory is still 226.5MB. Free memory was 156.3MB in the beginning and 135.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 00:22:14,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.60ms. Allocated memory is still 226.5MB. Free memory was 135.9MB in the beginning and 134.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:22:14,873 INFO L158 Benchmark]: Boogie Preprocessor took 58.10ms. Allocated memory is still 226.5MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:22:14,873 INFO L158 Benchmark]: RCFGBuilder took 556.16ms. Allocated memory is still 226.5MB. Free memory was 131.7MB in the beginning and 191.8MB in the end (delta: -60.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 00:22:14,873 INFO L158 Benchmark]: BuchiAutomizer took 9986.34ms. Allocated memory was 226.5MB in the beginning and 308.3MB in the end (delta: 81.8MB). Free memory was 191.8MB in the beginning and 145.3MB in the end (delta: 46.6MB). Peak memory consumption was 129.2MB. Max. memory is 16.1GB. [2024-10-12 00:22:14,873 INFO L158 Benchmark]: Witness Printer took 8.56ms. Allocated memory is still 308.3MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:22:14,876 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.56ms. Allocated memory is still 140.5MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.98ms. Allocated memory is still 226.5MB. Free memory was 156.3MB in the beginning and 135.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.60ms. Allocated memory is still 226.5MB. Free memory was 135.9MB in the beginning and 134.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.10ms. Allocated memory is still 226.5MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 556.16ms. Allocated memory is still 226.5MB. Free memory was 131.7MB in the beginning and 191.8MB in the end (delta: -60.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 9986.34ms. Allocated memory was 226.5MB in the beginning and 308.3MB in the end (delta: 81.8MB). Free memory was 191.8MB in the beginning and 145.3MB in the end (delta: 46.6MB). Peak memory consumption was 129.2MB. Max. memory is 16.1GB. * Witness Printer took 8.56ms. Allocated memory is still 308.3MB. Free memory is still 145.3MB. 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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - 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: #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 * 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 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 8.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 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, 91 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 99 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital267 mio100 ax100 hnf100 lsp109 ukn61 mio100 lsp30 div161 bol100 ite100 ukn100 eq154 hnf96 smp67 dnf801 smp32 tf100 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 335ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 196 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:22:14,912 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:22:15,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE