/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-lit/sssc12.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:17:42,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:17:42,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:17:42,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:17:42,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:17:42,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:17:42,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:17:42,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:17:42,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:17:42,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:17:42,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:17:42,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:17:42,806 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:17:42,806 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:17:42,806 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:17:42,806 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:17:42,806 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:17:42,806 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:17:42,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:17:42,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:17:42,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:17:42,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:17:42,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:17:42,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:17:42,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:17:42,808 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:17:42,808 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:17:42,808 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:17:43,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:17:43,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:17:43,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:17:43,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:17:43,015 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:17:43,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-lit/sssc12.i [2025-04-26 18:17:44,238 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2257f6f79/444a79ae094e4b45a55575d624d988bc/FLAGc8f8386aa [2025-04-26 18:17:44,484 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:17:44,484 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i [2025-04-26 18:17:44,494 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2257f6f79/444a79ae094e4b45a55575d624d988bc/FLAGc8f8386aa [2025-04-26 18:17:45,288 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2257f6f79/444a79ae094e4b45a55575d624d988bc [2025-04-26 18:17:45,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:17:45,291 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:17:45,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:17:45,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:17:45,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:17:45,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5b278f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45, skipping insertion in model container [2025-04-26 18:17:45,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:17:45,627 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i[47777,47790] [2025-04-26 18:17:45,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:17:45,655 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:17:45,699 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12.i[47777,47790] [2025-04-26 18:17:45,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:17:45,739 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:17:45,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45 WrapperNode [2025-04-26 18:17:45,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:17:45,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:17:45,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:17:45,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:17:45,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,775 INFO L138 Inliner]: procedures = 272, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2025-04-26 18:17:45,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:17:45,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:17:45,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:17:45,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:17:45,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:17:45,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:17:45,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:17:45,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:17:45,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (1/1) ... [2025-04-26 18:17:45,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:17:45,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:45,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:45,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:17:45,848 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-04-26 18:17:45,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-04-26 18:17:45,848 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-26 18:17:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 18:17:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-26 18:17:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-26 18:17:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:17:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:17:45,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:17:45,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:17:45,850 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:17:45,933 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:17:45,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:17:46,061 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:17:46,061 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:17:46,080 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:17:46,080 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 18:17:46,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:17:46 BoogieIcfgContainer [2025-04-26 18:17:46,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:17:46,081 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:17:46,081 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:17:46,085 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:17:46,085 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:46,085 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:17:45" (1/3) ... [2025-04-26 18:17:46,086 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76837857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:17:46, skipping insertion in model container [2025-04-26 18:17:46,086 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:46,086 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:45" (2/3) ... [2025-04-26 18:17:46,086 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76837857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:17:46, skipping insertion in model container [2025-04-26 18:17:46,086 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:46,086 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:17:46" (3/3) ... [2025-04-26 18:17:46,087 INFO L376 chiAutomizerObserver]: Analyzing ICFG sssc12.i [2025-04-26 18:17:46,147 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:17:46,174 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:17:46,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:17:46,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:46,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:46,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:17:46,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 77 transitions, 158 flow [2025-04-26 18:17:46,258 INFO L116 PetriNetUnfolderBase]: 5/85 cut-off events. [2025-04-26 18:17:46,259 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-26 18:17:46,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 85 events. 5/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-04-26 18:17:46,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 77 transitions, 158 flow [2025-04-26 18:17:46,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 77 transitions, 158 flow [2025-04-26 18:17:46,265 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 75 places, 77 transitions, 158 flow [2025-04-26 18:17:46,266 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 77 transitions, 158 flow [2025-04-26 18:17:46,311 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 378 states, 375 states have (on average 1.9706666666666666) internal successors, (in total 739), 377 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:46,312 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 378 states, 375 states have (on average 1.9706666666666666) internal successors, (in total 739), 377 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:46,314 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:17:46,392 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 660#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrFINAL]true [2025-04-26 18:17:46,431 WARN L140 AmpleReduction]: Number of pruned transitions: 95 [2025-04-26 18:17:46,431 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:17:46,432 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 18:17:46,432 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:66 [2025-04-26 18:17:46,432 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:90 [2025-04-26 18:17:46,432 WARN L145 AmpleReduction]: Times succ was already a loop node:2 [2025-04-26 18:17:46,432 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:4 [2025-04-26 18:17:46,432 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:17:46,432 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 161 states, 158 states have (on average 1.1962025316455696) internal successors, (in total 189), 160 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:46,438 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:17:46,438 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:17:46,439 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:17:46,439 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:17:46,439 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:17:46,439 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:17:46,439 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:17:46,439 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:17:46,440 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 161 states, 158 states have (on average 1.1962025316455696) internal successors, (in total 189), 160 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:46,456 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 68 [2025-04-26 18:17:46,456 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:46,456 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:46,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:46,462 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:46,462 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:17:46,462 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 161 states, 158 states have (on average 1.1962025316455696) internal successors, (in total 189), 160 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:46,469 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 68 [2025-04-26 18:17:46,469 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:46,469 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:46,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:46,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:46,478 INFO L752 eck$LassoCheckResult]: Stem: "[134] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[146] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[160] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[179] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[153] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[136] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[114] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[116] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[166] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[141] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[117] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[121] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[154] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[165] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[152] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[107] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[129] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[168] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[138] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[142] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[175] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[157] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[170] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[140] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[119] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[127] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[126] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[178] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[151] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[133] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[112] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[173] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[109] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[120] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[158] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[214] L1060-2-->$Ultimate##0: Formula: (and (= |v_thrThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre8#1_7| v_thrThread1of1ForFork0_thidvar0_2) (= |v_thrThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_thrThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_20|, thrThread1of1ForFork0_~arg#1.offset=|v_thrThread1of1ForFork0_~arg#1.offset_4|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_14|, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of1ForFork0_~arg#1.base=|v_thrThread1of1ForFork0_~arg#1.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|, thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_4|, thrThread1of1ForFork0_thidvar0=v_thrThread1of1ForFork0_thidvar0_2, thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_6|, thrThread1of1ForFork0_#res#1.offset=|v_thrThread1of1ForFork0_#res#1.offset_4|, thrThread1of1ForFork0_thidvar1=v_thrThread1of1ForFork0_thidvar1_2, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_4|, thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_6|, thrThread1of1ForFork0_#res#1.base=|v_thrThread1of1ForFork0_#res#1.base_4|, thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_12|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1, thrThread1of1ForFork0_~arg#1.offset, thrThread1of1ForFork0_~end~0#1, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of1ForFork0_~arg#1.base, thrThread1of1ForFork0_#in~arg#1.base, thrThread1of1ForFork0_thidvar0, thrThread1of1ForFork0_#t~ret4#1, thrThread1of1ForFork0_#res#1.offset, thrThread1of1ForFork0_thidvar1, thrThread1of1ForFork0_#in~arg#1.offset, thrThread1of1ForFork0_#t~ret5#1, thrThread1of1ForFork0_#res#1.base, thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[182] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of1ForFork0_#in~arg#1.base_1| |v_thrThread1of1ForFork0_~arg#1.base_1|) (= |v_thrThread1of1ForFork0_~arg#1.offset_1| |v_thrThread1of1ForFork0_#in~arg#1.offset_1|)) InVars {thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_1|, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of1ForFork0_~arg#1.offset=|v_thrThread1of1ForFork0_~arg#1.offset_1|, thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_1|, thrThread1of1ForFork0_~arg#1.base=|v_thrThread1of1ForFork0_~arg#1.base_1|, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~arg#1.offset, thrThread1of1ForFork0_~arg#1.base]" "[183] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" "[184] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~end~0#1]" "[185] L1038-->L1039: Formula: (= |v_thrThread1of1ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" "[186] L1039-->L1040: Formula: (= |v_thrThread1of1ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~end~0#1]" "[187] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread1of1ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_1|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of1ForFork0_#t~ret4#1]" "[188] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_#t~ret4#1]" "[190] L1041-->L1041-2: Formula: (< v_~len~0_6 (+ v_~next~0_7 10)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[]" "[192] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of1ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of1ForFork0_#t~ret5#1]" "[194] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_#t~ret5#1]" "[159] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[161] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[108] L1059-1-->L1062: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:17:46,478 INFO L754 eck$LassoCheckResult]: Loop: "[197] L1046-1-->L1047: Formula: (< |v_thrThread1of1ForFork0_~c~0#1_9| |v_thrThread1of1ForFork0_~end~0#1_11|) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_9|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_11|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_9|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_11|} AuxVars[] AssignedVars[]" "[199] L1047-->L1047-1: Formula: (= (ite (and (<= 0 |v_thrThread1of1ForFork0_~c~0#1_11|) (< |v_thrThread1of1ForFork0_~c~0#1_11| v_~len~0_7)) 1 0) |v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_11|, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1]" "[201] L1047-1-->L1023: Formula: true InVars {} OutVars{thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[202] L1023-->L1024: Formula: (= |v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3| |v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_3|) InVars {thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|, thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[204] L1024-->L1024-2: Formula: (not (= |v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[207] L1024-2-->L1047-2: Formula: true InVars {} OutVars{thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[209] L1047-2-->L1048: Formula: true InVars {} OutVars{thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1]" "[210] L1048-->L1048-1: Formula: (let ((.cse1 (* 4 |v_thrThread1of1ForFork0_~c~0#1_13|))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (select |v_#valid_7| v_~data~0.base_3) 1) (<= 0 .cse0) (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_6| v_~data~0.base_3))))) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_13|, #memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_13|, #memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#memory_int]" "[211] L1048-1-->L1046-1: Formula: (= (+ 1 |v_thrThread1of1ForFork0_~c~0#1_15|) |v_thrThread1of1ForFork0_~c~0#1_16|) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_15|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" [2025-04-26 18:17:46,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash -669615452, now seen corresponding path program 1 times [2025-04-26 18:17:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:46,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165557146] [2025-04-26 18:17:46,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:46,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:46,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-26 18:17:46,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-26 18:17:46,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:46,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:17:46,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:46,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165557146] [2025-04-26 18:17:46,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165557146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:46,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:46,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 18:17:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979119972] [2025-04-26 18:17:46,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:46,669 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:17:46,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1173344213, now seen corresponding path program 1 times [2025-04-26 18:17:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:46,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496670732] [2025-04-26 18:17:46,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:46,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:46,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:46,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:46,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:46,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:46,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:46,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:46,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:46,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:46,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:46,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:46,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:46,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-26 18:17:46,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-26 18:17:46,828 INFO L87 Difference]: Start difference. First operand has 161 states, 158 states have (on average 1.1962025316455696) internal successors, (in total 189), 160 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 49.0) internal successors, (in total 49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:46,842 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2025-04-26 18:17:46,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 101 transitions. [2025-04-26 18:17:46,848 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2025-04-26 18:17:46,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 90 states and 100 transitions. [2025-04-26 18:17:46,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2025-04-26 18:17:46,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2025-04-26 18:17:46,852 INFO L74 IsDeterministic]: Start isDeterministic. Operand 90 states and 100 transitions. [2025-04-26 18:17:46,853 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:46,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 100 transitions. [2025-04-26 18:17:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 100 transitions. [2025-04-26 18:17:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-04-26 18:17:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.1111111111111112) internal successors, (in total 100), 89 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2025-04-26 18:17:46,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 100 transitions. [2025-04-26 18:17:46,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:17:46,875 INFO L438 stractBuchiCegarLoop]: Abstraction has 90 states and 100 transitions. [2025-04-26 18:17:46,875 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:17:46,875 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 100 transitions. [2025-04-26 18:17:46,876 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2025-04-26 18:17:46,876 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:46,876 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:46,878 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:46,879 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:46,880 INFO L752 eck$LassoCheckResult]: Stem: "[134] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[146] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[160] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[179] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[153] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[136] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[114] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[116] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[166] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[141] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[117] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[121] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[154] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[165] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[152] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[107] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[129] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[168] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[138] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[142] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[175] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[157] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[170] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[140] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[119] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[127] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[126] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[178] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[151] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[133] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[112] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[173] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[109] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[120] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[158] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[214] L1060-2-->$Ultimate##0: Formula: (and (= |v_thrThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre8#1_7| v_thrThread1of1ForFork0_thidvar0_2) (= |v_thrThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_thrThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_20|, thrThread1of1ForFork0_~arg#1.offset=|v_thrThread1of1ForFork0_~arg#1.offset_4|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_14|, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of1ForFork0_~arg#1.base=|v_thrThread1of1ForFork0_~arg#1.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|, thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_4|, thrThread1of1ForFork0_thidvar0=v_thrThread1of1ForFork0_thidvar0_2, thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_6|, thrThread1of1ForFork0_#res#1.offset=|v_thrThread1of1ForFork0_#res#1.offset_4|, thrThread1of1ForFork0_thidvar1=v_thrThread1of1ForFork0_thidvar1_2, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_4|, thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_6|, thrThread1of1ForFork0_#res#1.base=|v_thrThread1of1ForFork0_#res#1.base_4|, thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_12|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1, thrThread1of1ForFork0_~arg#1.offset, thrThread1of1ForFork0_~end~0#1, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of1ForFork0_~arg#1.base, thrThread1of1ForFork0_#in~arg#1.base, thrThread1of1ForFork0_thidvar0, thrThread1of1ForFork0_#t~ret4#1, thrThread1of1ForFork0_#res#1.offset, thrThread1of1ForFork0_thidvar1, thrThread1of1ForFork0_#in~arg#1.offset, thrThread1of1ForFork0_#t~ret5#1, thrThread1of1ForFork0_#res#1.base, thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[182] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of1ForFork0_#in~arg#1.base_1| |v_thrThread1of1ForFork0_~arg#1.base_1|) (= |v_thrThread1of1ForFork0_~arg#1.offset_1| |v_thrThread1of1ForFork0_#in~arg#1.offset_1|)) InVars {thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_1|, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of1ForFork0_~arg#1.offset=|v_thrThread1of1ForFork0_~arg#1.offset_1|, thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_1|, thrThread1of1ForFork0_~arg#1.base=|v_thrThread1of1ForFork0_~arg#1.base_1|, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~arg#1.offset, thrThread1of1ForFork0_~arg#1.base]" "[183] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" "[184] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~end~0#1]" "[185] L1038-->L1039: Formula: (= |v_thrThread1of1ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" "[186] L1039-->L1040: Formula: (= |v_thrThread1of1ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~end~0#1]" "[187] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread1of1ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_1|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of1ForFork0_#t~ret4#1]" "[188] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_#t~ret4#1]" "[190] L1041-->L1041-2: Formula: (< v_~len~0_6 (+ v_~next~0_7 10)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[]" "[192] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of1ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of1ForFork0_#t~ret5#1]" "[194] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_#t~ret5#1]" "[159] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[161] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[109] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[120] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[158] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" [2025-04-26 18:17:46,880 INFO L754 eck$LassoCheckResult]: Loop: "[197] L1046-1-->L1047: Formula: (< |v_thrThread1of1ForFork0_~c~0#1_9| |v_thrThread1of1ForFork0_~end~0#1_11|) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_9|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_11|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_9|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_11|} AuxVars[] AssignedVars[]" "[199] L1047-->L1047-1: Formula: (= (ite (and (<= 0 |v_thrThread1of1ForFork0_~c~0#1_11|) (< |v_thrThread1of1ForFork0_~c~0#1_11| v_~len~0_7)) 1 0) |v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_11|, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1]" "[201] L1047-1-->L1023: Formula: true InVars {} OutVars{thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[202] L1023-->L1024: Formula: (= |v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3| |v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_3|) InVars {thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|, thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[204] L1024-->L1024-2: Formula: (not (= |v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[207] L1024-2-->L1047-2: Formula: true InVars {} OutVars{thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[209] L1047-2-->L1048: Formula: true InVars {} OutVars{thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1]" "[210] L1048-->L1048-1: Formula: (let ((.cse1 (* 4 |v_thrThread1of1ForFork0_~c~0#1_13|))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (select |v_#valid_7| v_~data~0.base_3) 1) (<= 0 .cse0) (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_6| v_~data~0.base_3))))) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_13|, #memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_13|, #memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#memory_int]" "[211] L1048-1-->L1046-1: Formula: (= (+ 1 |v_thrThread1of1ForFork0_~c~0#1_15|) |v_thrThread1of1ForFork0_~c~0#1_16|) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_15|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" [2025-04-26 18:17:46,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash 744649867, now seen corresponding path program 1 times [2025-04-26 18:17:46,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:46,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616488985] [2025-04-26 18:17:46,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:46,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:46,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-26 18:17:46,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-26 18:17:46,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:46,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:46,912 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:46,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-26 18:17:46,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-26 18:17:46,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:46,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:46,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:46,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1173344213, now seen corresponding path program 2 times [2025-04-26 18:17:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:46,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40565135] [2025-04-26 18:17:46,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:17:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:46,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:46,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:46,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:17:46,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:46,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:46,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:46,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:46,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:46,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:46,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:46,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1388787425, now seen corresponding path program 1 times [2025-04-26 18:17:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:46,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236152554] [2025-04-26 18:17:46,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:46,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 18:17:46,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 18:17:46,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:46,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:17:47,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:47,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236152554] [2025-04-26 18:17:47,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236152554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:47,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:47,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:17:47,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490917899] [2025-04-26 18:17:47,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:47,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:47,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:17:47,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:17:47,187 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 15.0) internal successors, (in total 60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:47,213 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2025-04-26 18:17:47,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 107 transitions. [2025-04-26 18:17:47,214 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2025-04-26 18:17:47,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 96 states and 107 transitions. [2025-04-26 18:17:47,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2025-04-26 18:17:47,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2025-04-26 18:17:47,215 INFO L74 IsDeterministic]: Start isDeterministic. Operand 96 states and 107 transitions. [2025-04-26 18:17:47,215 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:47,215 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 107 transitions. [2025-04-26 18:17:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 107 transitions. [2025-04-26 18:17:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-04-26 18:17:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.1195652173913044) internal successors, (in total 103), 91 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2025-04-26 18:17:47,222 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 103 transitions. [2025-04-26 18:17:47,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:17:47,223 INFO L438 stractBuchiCegarLoop]: Abstraction has 92 states and 103 transitions. [2025-04-26 18:17:47,223 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:17:47,223 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 103 transitions. [2025-04-26 18:17:47,223 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2025-04-26 18:17:47,223 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:47,223 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:47,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:47,224 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:47,225 INFO L752 eck$LassoCheckResult]: Stem: "[134] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[146] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[160] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[179] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[153] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[136] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[114] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[116] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[166] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[141] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[117] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[121] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[154] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[165] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[152] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[107] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[129] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[168] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[138] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[142] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[175] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[157] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[170] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[140] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[119] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[127] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[126] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[178] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[151] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[133] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[112] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[173] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[109] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[120] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[158] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[214] L1060-2-->$Ultimate##0: Formula: (and (= |v_thrThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre8#1_7| v_thrThread1of1ForFork0_thidvar0_2) (= |v_thrThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_thrThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_20|, thrThread1of1ForFork0_~arg#1.offset=|v_thrThread1of1ForFork0_~arg#1.offset_4|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_14|, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of1ForFork0_~arg#1.base=|v_thrThread1of1ForFork0_~arg#1.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|, thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_4|, thrThread1of1ForFork0_thidvar0=v_thrThread1of1ForFork0_thidvar0_2, thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_6|, thrThread1of1ForFork0_#res#1.offset=|v_thrThread1of1ForFork0_#res#1.offset_4|, thrThread1of1ForFork0_thidvar1=v_thrThread1of1ForFork0_thidvar1_2, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_4|, thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_6|, thrThread1of1ForFork0_#res#1.base=|v_thrThread1of1ForFork0_#res#1.base_4|, thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_12|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1, thrThread1of1ForFork0_~arg#1.offset, thrThread1of1ForFork0_~end~0#1, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of1ForFork0_~arg#1.base, thrThread1of1ForFork0_#in~arg#1.base, thrThread1of1ForFork0_thidvar0, thrThread1of1ForFork0_#t~ret4#1, thrThread1of1ForFork0_#res#1.offset, thrThread1of1ForFork0_thidvar1, thrThread1of1ForFork0_#in~arg#1.offset, thrThread1of1ForFork0_#t~ret5#1, thrThread1of1ForFork0_#res#1.base, thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[182] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of1ForFork0_#in~arg#1.base_1| |v_thrThread1of1ForFork0_~arg#1.base_1|) (= |v_thrThread1of1ForFork0_~arg#1.offset_1| |v_thrThread1of1ForFork0_#in~arg#1.offset_1|)) InVars {thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_1|, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of1ForFork0_~arg#1.offset=|v_thrThread1of1ForFork0_~arg#1.offset_1|, thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_1|, thrThread1of1ForFork0_~arg#1.base=|v_thrThread1of1ForFork0_~arg#1.base_1|, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~arg#1.offset, thrThread1of1ForFork0_~arg#1.base]" "[183] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" "[184] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~end~0#1]" "[185] L1038-->L1039: Formula: (= |v_thrThread1of1ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" "[186] L1039-->L1040: Formula: (= |v_thrThread1of1ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~end~0#1]" "[187] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread1of1ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_1|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of1ForFork0_#t~ret4#1]" "[188] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_#t~ret4#1]" "[189] L1041-->L1042: Formula: (<= (+ v_~next~0_3 10) v_~len~0_5) InVars {~next~0=v_~next~0_3, ~len~0=v_~len~0_5} OutVars{~next~0=v_~next~0_3, ~len~0=v_~len~0_5} AuxVars[] AssignedVars[]" "[191] L1042-->L1043: Formula: (= v_~next~0_4 |v_thrThread1of1ForFork0_~c~0#1_5|) InVars {~next~0=v_~next~0_4} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_5|, ~next~0=v_~next~0_4} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" "[193] L1043-->L1043-1: Formula: (= (+ v_~next~0_5 10) |v_thrThread1of1ForFork0_~end~0#1_5|) InVars {~next~0=v_~next~0_5} OutVars{~next~0=v_~next~0_5, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_5|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~end~0#1]" "[159] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[161] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[109] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[120] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[158] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[195] L1043-1-->L1041-2: Formula: (= v_~next~0_6 |v_thrThread1of1ForFork0_~end~0#1_7|) InVars {thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_7|} OutVars{~next~0=v_~next~0_6, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_7|} AuxVars[] AssignedVars[~next~0]" "[192] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of1ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of1ForFork0_#t~ret5#1]" "[194] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_#t~ret5#1]" [2025-04-26 18:17:47,225 INFO L754 eck$LassoCheckResult]: Loop: "[197] L1046-1-->L1047: Formula: (< |v_thrThread1of1ForFork0_~c~0#1_9| |v_thrThread1of1ForFork0_~end~0#1_11|) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_9|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_11|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_9|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_11|} AuxVars[] AssignedVars[]" "[199] L1047-->L1047-1: Formula: (= (ite (and (<= 0 |v_thrThread1of1ForFork0_~c~0#1_11|) (< |v_thrThread1of1ForFork0_~c~0#1_11| v_~len~0_7)) 1 0) |v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_11|, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1]" "[201] L1047-1-->L1023: Formula: true InVars {} OutVars{thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[202] L1023-->L1024: Formula: (= |v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3| |v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_3|) InVars {thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|, thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[204] L1024-->L1024-2: Formula: (not (= |v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[207] L1024-2-->L1047-2: Formula: true InVars {} OutVars{thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[209] L1047-2-->L1048: Formula: true InVars {} OutVars{thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1]" "[210] L1048-->L1048-1: Formula: (let ((.cse1 (* 4 |v_thrThread1of1ForFork0_~c~0#1_13|))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (select |v_#valid_7| v_~data~0.base_3) 1) (<= 0 .cse0) (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_6| v_~data~0.base_3))))) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_13|, #memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_13|, #memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#memory_int]" "[211] L1048-1-->L1046-1: Formula: (= (+ 1 |v_thrThread1of1ForFork0_~c~0#1_15|) |v_thrThread1of1ForFork0_~c~0#1_16|) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_15|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" [2025-04-26 18:17:47,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash -135750471, now seen corresponding path program 1 times [2025-04-26 18:17:47,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:47,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028526689] [2025-04-26 18:17:47,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:47,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:47,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:17:47,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:17:47,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:47,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:47,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:47,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:17:47,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:17:47,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:47,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:47,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:47,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1173344213, now seen corresponding path program 3 times [2025-04-26 18:17:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:47,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213168026] [2025-04-26 18:17:47,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:17:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:47,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:47,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:47,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:17:47,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:47,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:47,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:47,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:47,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:47,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:47,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:47,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2095080051, now seen corresponding path program 1 times [2025-04-26 18:17:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:47,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306834540] [2025-04-26 18:17:47,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:47,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 18:17:47,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 18:17:47,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:47,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:47,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:47,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 18:17:47,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 18:17:47,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:47,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:47,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:47,950 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:17:47,951 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:17:47,951 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:17:47,951 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:17:47,951 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:17:47,951 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:47,951 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:17:47,951 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:17:47,951 INFO L132 ssoRankerPreferences]: Filename of dumped script: sssc12.i_petrified1_Iteration3_Lasso [2025-04-26 18:17:47,951 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:17:47,951 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:17:47,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:47,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:48,991 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:17:48,993 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:17:48,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:48,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:48,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:48,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:17:48,999 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 [2025-04-26 18:17:49,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,029 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:17:49,040 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 [2025-04-26 18:17:49,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,058 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:17:49,069 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 [2025-04-26 18:17:49,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:49,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:49,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:49,081 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:17:49,092 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 [2025-04-26 18:17:49,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:49,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:49,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:49,107 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,114 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:17:49,115 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 [2025-04-26 18:17:49,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,130 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:17:49,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,138 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:17:49,143 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 [2025-04-26 18:17:49,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,161 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,169 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:17:49,175 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 [2025-04-26 18:17:49,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,189 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:17:49,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,196 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:17:49,198 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 [2025-04-26 18:17:49,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,212 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,219 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:17:49,222 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 [2025-04-26 18:17:49,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,235 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,243 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:17:49,245 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 [2025-04-26 18:17:49,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:49,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:49,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:49,256 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,264 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:17:49,267 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 [2025-04-26 18:17:49,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:49,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:49,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:49,279 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,286 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:17:49,287 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 [2025-04-26 18:17:49,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,301 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:17:49,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,308 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:17:49,309 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 [2025-04-26 18:17:49,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:49,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:49,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:49,321 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:17:49,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,327 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:17:49,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:49,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:49,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:49,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:49,340 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:17:49,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,347 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:17:49,350 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 [2025-04-26 18:17:49,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,365 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,373 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:17:49,376 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 [2025-04-26 18:17:49,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,389 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,397 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:17:49,400 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 [2025-04-26 18:17:49,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,414 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,422 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:17:49,425 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 [2025-04-26 18:17:49,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,438 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,446 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:17:49,448 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 [2025-04-26 18:17:49,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,462 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,469 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:17:49,471 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 [2025-04-26 18:17:49,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,486 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:17:49,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,493 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:17:49,495 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 [2025-04-26 18:17:49,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,508 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:17:49,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,516 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:17:49,517 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 [2025-04-26 18:17:49,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,531 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:17:49,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,538 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:17:49,542 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 [2025-04-26 18:17:49,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,557 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:49,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:49,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,563 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:17:49,565 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 [2025-04-26 18:17:49,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:49,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:49,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:49,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:49,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:49,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:49,589 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:17:49,602 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:17:49,602 INFO L437 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:17:49,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:49,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:49,605 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:49,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:17:49,608 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:17:49,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:17:49,624 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:17:49,624 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:17:49,624 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thrThread1of1ForFork0_~end~0#1, thrThread1of1ForFork0_~c~0#1) = 1*thrThread1of1ForFork0_~end~0#1 - 1*thrThread1of1ForFork0_~c~0#1 Supporting invariants [] [2025-04-26 18:17:49,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:17:49,644 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-04-26 18:17:49,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:49,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:17:49,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:17:49,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:49,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:49,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:17:49,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:17:49,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:49,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:49,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:49,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:49,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:17:49,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:17:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:17:49,812 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 [2025-04-26 18:17:49,813 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 103 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 20.0) internal successors, (in total 60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:49,866 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 103 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (in total 60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 129 states and 160 transitions. Complement of second has 6 states. [2025-04-26 18:17:49,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:17:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (in total 60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 18:17:49,870 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 54 letters. Loop has 9 letters. [2025-04-26 18:17:49,871 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:17:49,871 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 63 letters. Loop has 9 letters. [2025-04-26 18:17:49,871 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:17:49,871 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 54 letters. Loop has 18 letters. [2025-04-26 18:17:49,873 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:17:49,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 160 transitions. [2025-04-26 18:17:49,875 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 18:17:49,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 109 states and 130 transitions. [2025-04-26 18:17:49,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2025-04-26 18:17:49,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2025-04-26 18:17:49,879 INFO L74 IsDeterministic]: Start isDeterministic. Operand 109 states and 130 transitions. [2025-04-26 18:17:49,879 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:17:49,879 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 130 transitions. [2025-04-26 18:17:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 130 transitions. [2025-04-26 18:17:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2025-04-26 18:17:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.1981132075471699) internal successors, (in total 127), 105 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2025-04-26 18:17:49,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 127 transitions. [2025-04-26 18:17:49,885 INFO L438 stractBuchiCegarLoop]: Abstraction has 106 states and 127 transitions. [2025-04-26 18:17:49,885 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:17:49,885 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 127 transitions. [2025-04-26 18:17:49,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 18:17:49,886 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:49,886 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:49,887 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:49,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:49,888 INFO L752 eck$LassoCheckResult]: Stem: "[134] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[146] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[160] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[179] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[153] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[136] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[114] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[116] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[166] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[141] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[117] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[121] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[154] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[165] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[152] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[107] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[129] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[168] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[138] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[142] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[175] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[157] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[170] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[140] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[119] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[127] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[126] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[178] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[151] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[133] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[112] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[173] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[109] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[120] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[158] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[214] L1060-2-->$Ultimate##0: Formula: (and (= |v_thrThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre8#1_7| v_thrThread1of1ForFork0_thidvar0_2) (= |v_thrThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_thrThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_20|, thrThread1of1ForFork0_~arg#1.offset=|v_thrThread1of1ForFork0_~arg#1.offset_4|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_14|, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of1ForFork0_~arg#1.base=|v_thrThread1of1ForFork0_~arg#1.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|, thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_4|, thrThread1of1ForFork0_thidvar0=v_thrThread1of1ForFork0_thidvar0_2, thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_6|, thrThread1of1ForFork0_#res#1.offset=|v_thrThread1of1ForFork0_#res#1.offset_4|, thrThread1of1ForFork0_thidvar1=v_thrThread1of1ForFork0_thidvar1_2, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_4|, thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_6|, thrThread1of1ForFork0_#res#1.base=|v_thrThread1of1ForFork0_#res#1.base_4|, thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_12|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1, thrThread1of1ForFork0_~arg#1.offset, thrThread1of1ForFork0_~end~0#1, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of1ForFork0_~arg#1.base, thrThread1of1ForFork0_#in~arg#1.base, thrThread1of1ForFork0_thidvar0, thrThread1of1ForFork0_#t~ret4#1, thrThread1of1ForFork0_#res#1.offset, thrThread1of1ForFork0_thidvar1, thrThread1of1ForFork0_#in~arg#1.offset, thrThread1of1ForFork0_#t~ret5#1, thrThread1of1ForFork0_#res#1.base, thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[182] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of1ForFork0_#in~arg#1.base_1| |v_thrThread1of1ForFork0_~arg#1.base_1|) (= |v_thrThread1of1ForFork0_~arg#1.offset_1| |v_thrThread1of1ForFork0_#in~arg#1.offset_1|)) InVars {thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_1|, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of1ForFork0_~arg#1.offset=|v_thrThread1of1ForFork0_~arg#1.offset_1|, thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_1|, thrThread1of1ForFork0_~arg#1.base=|v_thrThread1of1ForFork0_~arg#1.base_1|, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~arg#1.offset, thrThread1of1ForFork0_~arg#1.base]" "[183] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" "[184] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~end~0#1]" "[185] L1038-->L1039: Formula: (= |v_thrThread1of1ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1]" "[186] L1039-->L1040: Formula: (= |v_thrThread1of1ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~end~0#1]" "[187] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread1of1ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_1|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of1ForFork0_#t~ret4#1]" "[188] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_#t~ret4#1]" "[190] L1041-->L1041-2: Formula: (< v_~len~0_6 (+ v_~next~0_7 10)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[]" "[192] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of1ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of1ForFork0_#t~ret5#1]" "[194] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of1ForFork0_#t~ret5#1]" "[159] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[161] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[109] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[120] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[158] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[196] L1046-1-->L1051: Formula: (<= |v_thrThread1of1ForFork0_~end~0#1_9| |v_thrThread1of1ForFork0_~c~0#1_7|) InVars {thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_7|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_9|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_7|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_9|} AuxVars[] AssignedVars[]" "[198] L1051-->thrFINAL: Formula: (and (= |v_thrThread1of1ForFork0_#res#1.base_1| 0) (= |v_thrThread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thrThread1of1ForFork0_#res#1.offset=|v_thrThread1of1ForFork0_#res#1.offset_1|, thrThread1of1ForFork0_#res#1.base=|v_thrThread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thrThread1of1ForFork0_#res#1.offset, thrThread1of1ForFork0_#res#1.base]" "[212] L1060-2-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:17:49,888 INFO L754 eck$LassoCheckResult]: Loop: "[213] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:17:49,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:49,888 INFO L85 PathProgramCache]: Analyzing trace with hash 358298663, now seen corresponding path program 1 times [2025-04-26 18:17:49,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:49,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335675841] [2025-04-26 18:17:49,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:49,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:49,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:17:49,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:17:49,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:49,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:49,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:49,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:17:49,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:17:49,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:49,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:49,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:49,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash 244, now seen corresponding path program 1 times [2025-04-26 18:17:49,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:49,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108911869] [2025-04-26 18:17:49,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:49,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:49,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:49,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:49,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:49,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:49,934 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:49,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:49,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:49,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:49,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:49,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:49,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1777643122, now seen corresponding path program 1 times [2025-04-26 18:17:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:49,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612187811] [2025-04-26 18:17:49,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:49,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-26 18:17:49,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-26 18:17:49,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:49,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:49,955 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:49,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-26 18:17:49,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-26 18:17:49,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:49,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:49,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:50,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:17:50,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:17:50,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:50,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:50,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:50,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:17:50,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:17:50,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:50,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:50,611 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:17:50,623 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:17:50,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:50,632 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:17:50,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:17:50,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:50,634 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:50,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (28)] Waiting until timeout for monitored process [2025-04-26 18:17:50,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 108 transitions, 226 flow [2025-04-26 18:17:50,674 INFO L116 PetriNetUnfolderBase]: 8/126 cut-off events. [2025-04-26 18:17:50,675 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:17:50,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 126 events. 8/126 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 208 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 85. Up to 3 conditions per place. [2025-04-26 18:17:50,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 108 transitions, 226 flow [2025-04-26 18:17:50,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 108 transitions, 226 flow [2025-04-26 18:17:50,677 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 105 places, 108 transitions, 226 flow [2025-04-26 18:17:50,677 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 108 transitions, 226 flow [2025-04-26 18:17:50,891 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9758 states, 9751 states have (on average 3.1021433699107783) internal successors, (in total 30249), 9757 states have internal predecessors, (30249), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:50,911 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 9758 states, 9751 states have (on average 3.1021433699107783) internal successors, (in total 30249), 9757 states have internal predecessors, (30249), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:50,912 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:17:50,989 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16218#[thrEXIT, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,023 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 18058#[thrFINAL, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,059 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16214#[thrFINAL, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,061 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 18066#[thrFINAL, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,066 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15442#[thrFINAL, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,086 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5554#[L1040, L1041-2, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,096 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 11832#[L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1043-1]true [2025-04-26 18:17:51,096 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10894#[L1043, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,096 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9946#[L1043-1, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,096 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9024#[L1043-1, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,096 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7230#[L1040, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,099 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10882#[L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1043-1]true [2025-04-26 18:17:51,099 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9934#[L1043, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,099 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8988#[L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1042]true [2025-04-26 18:17:51,099 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8076#[L1043, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,100 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6364#[L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,102 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9922#[L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1043-1]true [2025-04-26 18:17:51,102 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8976#[L1042, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,102 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8044#[L1042, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,102 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7162#[L1042, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,102 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5556#[L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1042]true [2025-04-26 18:17:51,105 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8964#[L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1043-1]true [2025-04-26 18:17:51,105 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8032#[L1041, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,105 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7136#[L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1042]true [2025-04-26 18:17:51,105 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6306#[L1041, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,105 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4812#[L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1041]true [2025-04-26 18:17:51,109 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5510#[L1040, L1041-2, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,110 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7122#[L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1043-1]true [2025-04-26 18:17:51,110 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6282#[L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,110 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5500#[L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1042]true [2025-04-26 18:17:51,110 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4782#[L1040, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:17:51,110 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3528#[L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1040]true [2025-04-26 18:17:51,110 WARN L140 AmpleReduction]: Number of pruned transitions: 2016 [2025-04-26 18:17:51,110 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 32 [2025-04-26 18:17:51,111 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 76 [2025-04-26 18:17:51,111 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:229 [2025-04-26 18:17:51,111 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1149 [2025-04-26 18:17:51,111 WARN L145 AmpleReduction]: Times succ was already a loop node:19 [2025-04-26 18:17:51,111 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:76 [2025-04-26 18:17:51,111 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:17:51,113 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 1423 states, 1416 states have (on average 1.3418079096045197) internal successors, (in total 1900), 1422 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:51,113 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:17:51,113 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:17:51,113 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:17:51,113 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:17:51,113 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:17:51,114 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:17:51,114 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:17:51,114 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:17:51,115 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1423 states, 1416 states have (on average 1.3418079096045197) internal successors, (in total 1900), 1422 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:51,125 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 763 [2025-04-26 18:17:51,125 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:51,125 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:51,127 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:51,127 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:51,127 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:17:51,131 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1423 states, 1416 states have (on average 1.3418079096045197) internal successors, (in total 1900), 1422 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:51,143 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 763 [2025-04-26 18:17:51,143 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:51,143 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:51,144 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:51,144 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:51,145 INFO L752 eck$LassoCheckResult]: Stem: "[290] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[302] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[316] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[335] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[309] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[292] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[270] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[272] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[322] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[297] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[273] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[277] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[310] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[321] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[308] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[263] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[285] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[324] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[294] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[298] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[331] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[313] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[326] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[296] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[275] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[283] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[282] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[334] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[307] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[289] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[268] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[329] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[265] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[276] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[314] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[400] L1060-2-->$Ultimate##0: Formula: (and (= v_thrThread1of2ForFork0_thidvar1_2 0) (= |v_thrThread1of2ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of2ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre8#1_18| v_thrThread1of2ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_18|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_4|, thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_6|, thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_6|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_18|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_20|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_4|, thrThread1of2ForFork0_#res#1.offset=|v_thrThread1of2ForFork0_#res#1.offset_4|, thrThread1of2ForFork0_thidvar1=v_thrThread1of2ForFork0_thidvar1_2, thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_2, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of2ForFork0_#res#1.base=|v_thrThread1of2ForFork0_#res#1.base_4|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_4|, thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_14|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_4|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_#t~ret4#1, thrThread1of2ForFork0_#t~ret5#1, thrThread1of2ForFork0_~c~0#1, thrThread1of2ForFork0_#in~arg#1.base, thrThread1of2ForFork0_#res#1.offset, thrThread1of2ForFork0_thidvar1, thrThread1of2ForFork0_thidvar0, thrThread1of2ForFork0___VERIFIER_assert_~cond#1, thrThread1of2ForFork0_#res#1.base, thrThread1of2ForFork0_~arg#1.base, thrThread1of2ForFork0_~end~0#1, thrThread1of2ForFork0_#in~arg#1.offset]" "[368] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of2ForFork0_~arg#1.base_1| |v_thrThread1of2ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of2ForFork0_~arg#1.offset_1| |v_thrThread1of2ForFork0_#in~arg#1.offset_1|)) InVars {thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} OutVars{thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_1|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_1|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_~arg#1.base]" "[369] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" "[370] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1]" "[371] L1038-->L1039: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" "[372] L1039-->L1040: Formula: (= |v_thrThread1of2ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1]" "[315] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[317] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[264] L1059-1-->L1062: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[]" "[373] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread1of2ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of2ForFork0_#t~ret4#1]" "[374] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_#t~ret4#1]" "[376] L1041-->L1041-2: Formula: (< v_~len~0_6 (+ v_~next~0_7 10)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[]" "[378] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_1|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of2ForFork0_#t~ret5#1]" "[380] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_#t~ret5#1]" [2025-04-26 18:17:51,145 INFO L754 eck$LassoCheckResult]: Loop: "[383] L1046-1-->L1047: Formula: (< |v_thrThread1of2ForFork0_~c~0#1_9| |v_thrThread1of2ForFork0_~end~0#1_11|) InVars {thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[]" "[385] L1047-->L1047-1: Formula: (= |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (and (<= 0 |v_thrThread1of2ForFork0_~c~0#1_11|) (< |v_thrThread1of2ForFork0_~c~0#1_11| v_~len~0_7)) 1 0)) InVars {~len~0=v_~len~0_7, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1]" "[387] L1047-1-->L1023: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[388] L1023-->L1024: Formula: (= |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3| |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|) InVars {thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[390] L1024-->L1024-2: Formula: (not (= |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[393] L1024-2-->L1047-2: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[395] L1047-2-->L1048: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1]" "[396] L1048-->L1048-1: Formula: (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (select |v_#valid_7| v_~data~0.base_3) 1) (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= 0 .cse0) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_6| v_~data~0.base_3))))) InVars {#memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} OutVars{#memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} AuxVars[] AssignedVars[#memory_int]" "[397] L1048-1-->L1046-1: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_16| (+ |v_thrThread1of2ForFork0_~c~0#1_15| 1)) InVars {thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_15|} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" [2025-04-26 18:17:51,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:51,145 INFO L85 PathProgramCache]: Analyzing trace with hash -675989336, now seen corresponding path program 1 times [2025-04-26 18:17:51,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:51,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068298590] [2025-04-26 18:17:51,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:51,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:51,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-26 18:17:51,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-26 18:17:51,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:17:51,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:51,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068298590] [2025-04-26 18:17:51,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068298590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:51,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:51,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:17:51,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423545217] [2025-04-26 18:17:51,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:51,166 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:17:51,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:51,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1532734491, now seen corresponding path program 1 times [2025-04-26 18:17:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:51,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528867829] [2025-04-26 18:17:51,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:51,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:51,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:51,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:51,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:51,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:51,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:51,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:51,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-26 18:17:51,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-26 18:17:51,219 INFO L87 Difference]: Start difference. First operand has 1423 states, 1416 states have (on average 1.3418079096045197) internal successors, (in total 1900), 1422 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (in total 49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:51,237 INFO L93 Difference]: Finished difference Result 668 states and 867 transitions. [2025-04-26 18:17:51,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 668 states and 867 transitions. [2025-04-26 18:17:51,242 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 233 [2025-04-26 18:17:51,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 668 states to 667 states and 866 transitions. [2025-04-26 18:17:51,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 667 [2025-04-26 18:17:51,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 667 [2025-04-26 18:17:51,246 INFO L74 IsDeterministic]: Start isDeterministic. Operand 667 states and 866 transitions. [2025-04-26 18:17:51,251 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:51,251 INFO L218 hiAutomatonCegarLoop]: Abstraction has 667 states and 866 transitions. [2025-04-26 18:17:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 866 transitions. [2025-04-26 18:17:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2025-04-26 18:17:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 667 states have (on average 1.2983508245877062) internal successors, (in total 866), 666 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 866 transitions. [2025-04-26 18:17:51,274 INFO L240 hiAutomatonCegarLoop]: Abstraction has 667 states and 866 transitions. [2025-04-26 18:17:51,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:17:51,275 INFO L438 stractBuchiCegarLoop]: Abstraction has 667 states and 866 transitions. [2025-04-26 18:17:51,275 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:17:51,275 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 667 states and 866 transitions. [2025-04-26 18:17:51,277 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 233 [2025-04-26 18:17:51,277 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:51,277 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:51,278 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:51,278 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:51,279 INFO L752 eck$LassoCheckResult]: Stem: "[290] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[302] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[316] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[335] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[309] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[292] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[270] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[272] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[322] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[297] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[273] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[277] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[310] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[321] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[308] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[263] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[285] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[324] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[294] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[298] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[331] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[313] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[326] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[296] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[275] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[283] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[282] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[334] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[307] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[289] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[268] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[329] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[265] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[276] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[314] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[400] L1060-2-->$Ultimate##0: Formula: (and (= v_thrThread1of2ForFork0_thidvar1_2 0) (= |v_thrThread1of2ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of2ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre8#1_18| v_thrThread1of2ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_18|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_4|, thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_6|, thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_6|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_18|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_20|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_4|, thrThread1of2ForFork0_#res#1.offset=|v_thrThread1of2ForFork0_#res#1.offset_4|, thrThread1of2ForFork0_thidvar1=v_thrThread1of2ForFork0_thidvar1_2, thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_2, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of2ForFork0_#res#1.base=|v_thrThread1of2ForFork0_#res#1.base_4|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_4|, thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_14|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_4|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_#t~ret4#1, thrThread1of2ForFork0_#t~ret5#1, thrThread1of2ForFork0_~c~0#1, thrThread1of2ForFork0_#in~arg#1.base, thrThread1of2ForFork0_#res#1.offset, thrThread1of2ForFork0_thidvar1, thrThread1of2ForFork0_thidvar0, thrThread1of2ForFork0___VERIFIER_assert_~cond#1, thrThread1of2ForFork0_#res#1.base, thrThread1of2ForFork0_~arg#1.base, thrThread1of2ForFork0_~end~0#1, thrThread1of2ForFork0_#in~arg#1.offset]" "[368] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of2ForFork0_~arg#1.base_1| |v_thrThread1of2ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of2ForFork0_~arg#1.offset_1| |v_thrThread1of2ForFork0_#in~arg#1.offset_1|)) InVars {thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} OutVars{thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_1|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_1|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_~arg#1.base]" "[369] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" "[370] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1]" "[371] L1038-->L1039: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" "[372] L1039-->L1040: Formula: (= |v_thrThread1of2ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1]" "[315] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[317] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[276] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[314] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[373] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread1of2ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of2ForFork0_#t~ret4#1]" "[374] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_#t~ret4#1]" "[376] L1041-->L1041-2: Formula: (< v_~len~0_6 (+ v_~next~0_7 10)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[]" "[378] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_1|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of2ForFork0_#t~ret5#1]" "[380] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_#t~ret5#1]" [2025-04-26 18:17:51,279 INFO L754 eck$LassoCheckResult]: Loop: "[383] L1046-1-->L1047: Formula: (< |v_thrThread1of2ForFork0_~c~0#1_9| |v_thrThread1of2ForFork0_~end~0#1_11|) InVars {thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[]" "[385] L1047-->L1047-1: Formula: (= |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (and (<= 0 |v_thrThread1of2ForFork0_~c~0#1_11|) (< |v_thrThread1of2ForFork0_~c~0#1_11| v_~len~0_7)) 1 0)) InVars {~len~0=v_~len~0_7, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1]" "[387] L1047-1-->L1023: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[388] L1023-->L1024: Formula: (= |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3| |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|) InVars {thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[390] L1024-->L1024-2: Formula: (not (= |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[393] L1024-2-->L1047-2: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[395] L1047-2-->L1048: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1]" "[396] L1048-->L1048-1: Formula: (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (select |v_#valid_7| v_~data~0.base_3) 1) (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= 0 .cse0) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_6| v_~data~0.base_3))))) InVars {#memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} OutVars{#memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} AuxVars[] AssignedVars[#memory_int]" "[397] L1048-1-->L1046-1: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_16| (+ |v_thrThread1of2ForFork0_~c~0#1_15| 1)) InVars {thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_15|} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" [2025-04-26 18:17:51,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1252021535, now seen corresponding path program 1 times [2025-04-26 18:17:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:51,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907784606] [2025-04-26 18:17:51,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:51,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-26 18:17:51,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-26 18:17:51,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,287 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:51,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-26 18:17:51,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-26 18:17:51,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:51,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1532734491, now seen corresponding path program 2 times [2025-04-26 18:17:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:51,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885802617] [2025-04-26 18:17:51,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:17:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:51,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:51,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:51,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:17:51,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:51,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:51,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:51,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:51,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:51,304 INFO L85 PathProgramCache]: Analyzing trace with hash 260498693, now seen corresponding path program 1 times [2025-04-26 18:17:51,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:51,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940883970] [2025-04-26 18:17:51,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:51,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:51,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 18:17:51,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 18:17:51,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:17:51,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:51,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940883970] [2025-04-26 18:17:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940883970] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:51,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:51,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:17:51,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757322241] [2025-04-26 18:17:51,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:51,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:17:51,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:17:51,421 INFO L87 Difference]: Start difference. First operand 667 states and 866 transitions. cyclomatic complexity: 251 Second operand has 4 states, 4 states have (on average 15.0) internal successors, (in total 60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:51,458 INFO L93 Difference]: Finished difference Result 842 states and 1078 transitions. [2025-04-26 18:17:51,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 842 states and 1078 transitions. [2025-04-26 18:17:51,466 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 284 [2025-04-26 18:17:51,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 842 states to 842 states and 1078 transitions. [2025-04-26 18:17:51,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 842 [2025-04-26 18:17:51,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 842 [2025-04-26 18:17:51,471 INFO L74 IsDeterministic]: Start isDeterministic. Operand 842 states and 1078 transitions. [2025-04-26 18:17:51,473 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:51,473 INFO L218 hiAutomatonCegarLoop]: Abstraction has 842 states and 1078 transitions. [2025-04-26 18:17:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states and 1078 transitions. [2025-04-26 18:17:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 745. [2025-04-26 18:17:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 745 states have (on average 1.2926174496644296) internal successors, (in total 963), 744 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 963 transitions. [2025-04-26 18:17:51,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 745 states and 963 transitions. [2025-04-26 18:17:51,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:17:51,486 INFO L438 stractBuchiCegarLoop]: Abstraction has 745 states and 963 transitions. [2025-04-26 18:17:51,486 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:17:51,486 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 745 states and 963 transitions. [2025-04-26 18:17:51,490 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 242 [2025-04-26 18:17:51,490 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:51,490 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:51,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:51,490 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:51,491 INFO L752 eck$LassoCheckResult]: Stem: "[290] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[302] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[316] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[335] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[309] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[292] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[270] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[272] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[322] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[297] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[273] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[277] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[310] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[321] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[308] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[263] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[285] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[324] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[294] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[298] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[331] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[313] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[326] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[296] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[275] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[283] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[282] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[334] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[307] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[289] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[268] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[329] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[265] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[276] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[314] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[400] L1060-2-->$Ultimate##0: Formula: (and (= v_thrThread1of2ForFork0_thidvar1_2 0) (= |v_thrThread1of2ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of2ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre8#1_18| v_thrThread1of2ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_18|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_4|, thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_6|, thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_6|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_18|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_20|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_4|, thrThread1of2ForFork0_#res#1.offset=|v_thrThread1of2ForFork0_#res#1.offset_4|, thrThread1of2ForFork0_thidvar1=v_thrThread1of2ForFork0_thidvar1_2, thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_2, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of2ForFork0_#res#1.base=|v_thrThread1of2ForFork0_#res#1.base_4|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_4|, thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_14|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_4|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_#t~ret4#1, thrThread1of2ForFork0_#t~ret5#1, thrThread1of2ForFork0_~c~0#1, thrThread1of2ForFork0_#in~arg#1.base, thrThread1of2ForFork0_#res#1.offset, thrThread1of2ForFork0_thidvar1, thrThread1of2ForFork0_thidvar0, thrThread1of2ForFork0___VERIFIER_assert_~cond#1, thrThread1of2ForFork0_#res#1.base, thrThread1of2ForFork0_~arg#1.base, thrThread1of2ForFork0_~end~0#1, thrThread1of2ForFork0_#in~arg#1.offset]" "[368] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of2ForFork0_~arg#1.base_1| |v_thrThread1of2ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of2ForFork0_~arg#1.offset_1| |v_thrThread1of2ForFork0_#in~arg#1.offset_1|)) InVars {thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} OutVars{thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_1|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_1|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_~arg#1.base]" "[369] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" "[370] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1]" "[371] L1038-->L1039: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" "[372] L1039-->L1040: Formula: (= |v_thrThread1of2ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1]" "[315] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[317] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[276] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[314] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[373] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread1of2ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of2ForFork0_#t~ret4#1]" "[374] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_#t~ret4#1]" "[375] L1041-->L1042: Formula: (<= (+ v_~next~0_3 10) v_~len~0_5) InVars {~next~0=v_~next~0_3, ~len~0=v_~len~0_5} OutVars{~next~0=v_~next~0_3, ~len~0=v_~len~0_5} AuxVars[] AssignedVars[]" "[377] L1042-->L1043: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_5| v_~next~0_4) InVars {~next~0=v_~next~0_4} OutVars{~next~0=v_~next~0_4, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_5|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" "[379] L1043-->L1043-1: Formula: (= (+ v_~next~0_5 10) |v_thrThread1of2ForFork0_~end~0#1_5|) InVars {~next~0=v_~next~0_5} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_5|, ~next~0=v_~next~0_5} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1]" "[381] L1043-1-->L1041-2: Formula: (= v_~next~0_6 |v_thrThread1of2ForFork0_~end~0#1_7|) InVars {thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_7|} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_7|, ~next~0=v_~next~0_6} AuxVars[] AssignedVars[~next~0]" "[378] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_1|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of2ForFork0_#t~ret5#1]" "[380] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_#t~ret5#1]" [2025-04-26 18:17:51,491 INFO L754 eck$LassoCheckResult]: Loop: "[383] L1046-1-->L1047: Formula: (< |v_thrThread1of2ForFork0_~c~0#1_9| |v_thrThread1of2ForFork0_~end~0#1_11|) InVars {thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[]" "[385] L1047-->L1047-1: Formula: (= |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (and (<= 0 |v_thrThread1of2ForFork0_~c~0#1_11|) (< |v_thrThread1of2ForFork0_~c~0#1_11| v_~len~0_7)) 1 0)) InVars {~len~0=v_~len~0_7, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1]" "[387] L1047-1-->L1023: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[388] L1023-->L1024: Formula: (= |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3| |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|) InVars {thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[390] L1024-->L1024-2: Formula: (not (= |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[393] L1024-2-->L1047-2: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[395] L1047-2-->L1048: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1]" "[396] L1048-->L1048-1: Formula: (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (select |v_#valid_7| v_~data~0.base_3) 1) (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= 0 .cse0) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_6| v_~data~0.base_3))))) InVars {#memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} OutVars{#memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} AuxVars[] AssignedVars[#memory_int]" "[397] L1048-1-->L1046-1: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_16| (+ |v_thrThread1of2ForFork0_~c~0#1_15| 1)) InVars {thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_15|} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" [2025-04-26 18:17:51,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1506754945, now seen corresponding path program 1 times [2025-04-26 18:17:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:51,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645786553] [2025-04-26 18:17:51,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:51,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:17:51,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:17:51,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:51,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:17:51,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:17:51,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:51,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1532734491, now seen corresponding path program 3 times [2025-04-26 18:17:51,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:51,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848055741] [2025-04-26 18:17:51,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:17:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:51,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:51,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:51,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:17:51,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:51,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:51,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:51,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:51,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:51,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1299250393, now seen corresponding path program 1 times [2025-04-26 18:17:51,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:51,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730643770] [2025-04-26 18:17:51,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:51,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:51,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 18:17:51,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 18:17:51,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:51,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 18:17:51,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 18:17:51,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:51,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:51,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:51,951 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:17:51,951 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:17:51,951 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:17:51,951 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:17:51,951 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:17:51,951 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:51,951 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:17:51,951 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:17:51,951 INFO L132 ssoRankerPreferences]: Filename of dumped script: sssc12.i_petrified2_Iteration3_Lasso [2025-04-26 18:17:51,951 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:17:51,951 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:17:51,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:51,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:17:52,777 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:17:52,777 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:17:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:52,780 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:52,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 18:17:52,783 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 [2025-04-26 18:17:52,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:52,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:52,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:52,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:52,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:52,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:52,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:52,794 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:52,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 18:17:52,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:52,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:52,801 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:52,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 18:17:52,803 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 [2025-04-26 18:17:52,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:52,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:52,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:52,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:52,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:52,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:52,816 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:52,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:52,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:52,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:52,823 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:52,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:17:52,825 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 [2025-04-26 18:17:52,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:52,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:52,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:52,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:52,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:52,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:52,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:52,835 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:52,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:52,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:52,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:52,842 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:52,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 18:17:52,845 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 [2025-04-26 18:17:52,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:52,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:52,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:52,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:52,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:52,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:52,858 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:52,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 18:17:52,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:52,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:52,869 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:52,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 18:17:52,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:52,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:52,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:52,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:52,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:52,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:52,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:52,885 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:52,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 18:17:52,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:52,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:52,892 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:52,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 18:17:52,894 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 [2025-04-26 18:17:52,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:52,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:52,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:52,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:52,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:52,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:52,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:52,905 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:52,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 18:17:52,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:52,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:52,912 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:52,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 18:17:52,913 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 [2025-04-26 18:17:52,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:52,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:52,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:52,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:52,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:52,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:52,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:52,925 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:52,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 18:17:52,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:52,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:52,932 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:52,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 18:17:52,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:52,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:52,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:52,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:52,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:52,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:52,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:52,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:52,945 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:52,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:52,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:52,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:52,952 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:52,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 18:17:52,953 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 [2025-04-26 18:17:52,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:52,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:52,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:52,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:52,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:52,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:52,965 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:52,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 18:17:52,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:52,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:52,972 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:52,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 18:17:52,973 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 [2025-04-26 18:17:52,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:52,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:52,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:52,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:52,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:52,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:52,985 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:52,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 18:17:52,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:52,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:52,992 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:52,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 18:17:52,994 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 [2025-04-26 18:17:53,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,007 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,014 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 18:17:53,015 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 [2025-04-26 18:17:53,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,028 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,035 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 18:17:53,036 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 [2025-04-26 18:17:53,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,053 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 18:17:53,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,059 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 18:17:53,061 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 [2025-04-26 18:17:53,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,074 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 18:17:53,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,081 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 18:17:53,083 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 [2025-04-26 18:17:53,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:53,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:53,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:53,094 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,100 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 18:17:53,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:53,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,115 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 18:17:53,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,121 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 18:17:53,123 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 [2025-04-26 18:17:53,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,135 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 18:17:53,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,141 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,155 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 [2025-04-26 18:17:53,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 18:17:53,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,167 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,174 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 18:17:53,175 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 [2025-04-26 18:17:53,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,188 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 18:17:53,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,194 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 18:17:53,196 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 [2025-04-26 18:17:53,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,208 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 18:17:53,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,216 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 18:17:53,219 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 [2025-04-26 18:17:53,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,231 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,238 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 18:17:53,239 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 [2025-04-26 18:17:53,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:53,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:53,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:53,250 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 18:17:53,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,256 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 18:17:53,258 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 [2025-04-26 18:17:53,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,270 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 18:17:53,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,277 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 18:17:53,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 [2025-04-26 18:17:53,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:53,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:53,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:53,288 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 18:17:53,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,296 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 18:17:53,297 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 [2025-04-26 18:17:53,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:53,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:53,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:53,309 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 18:17:53,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,315 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 18:17:53,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:53,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,329 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,337 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 18:17:53,339 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 [2025-04-26 18:17:53,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,351 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 18:17:53,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,358 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 18:17:53,359 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 [2025-04-26 18:17:53,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,371 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 18:17:53,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,378 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 18:17:53,380 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 [2025-04-26 18:17:53,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,393 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 18:17:53,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,400 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 18:17:53,403 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 [2025-04-26 18:17:53,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,415 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,422 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 18:17:53,423 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 [2025-04-26 18:17:53,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,435 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,442 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 18:17:53,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:53,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,455 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,462 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 18:17:53,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:53,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,475 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,482 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 18:17:53,483 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 [2025-04-26 18:17:53,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,495 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 18:17:53,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,502 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 18:17:53,503 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 [2025-04-26 18:17:53,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,516 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-04-26 18:17:53,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,523 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 18:17:53,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:53,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,536 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,543 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 18:17:53,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:53,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,558 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 18:17:53,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,565 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 18:17:53,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:53,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,578 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-04-26 18:17:53,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,585 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-04-26 18:17:53,586 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 [2025-04-26 18:17:53,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,599 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-04-26 18:17:53,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,605 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-04-26 18:17:53,607 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 [2025-04-26 18:17:53,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,619 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-04-26 18:17:53,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,627 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-04-26 18:17:53,628 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 [2025-04-26 18:17:53,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,641 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,648 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 18:17:53,649 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 [2025-04-26 18:17:53,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,661 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-04-26 18:17:53,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,668 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-04-26 18:17:53,669 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 [2025-04-26 18:17:53,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,681 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,690 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-04-26 18:17:53,692 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 [2025-04-26 18:17:53,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,705 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-04-26 18:17:53,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,713 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-04-26 18:17:53,715 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 [2025-04-26 18:17:53,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,727 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,734 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-04-26 18:17:53,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:53,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,748 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-04-26 18:17:53,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,754 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-04-26 18:17:53,755 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 [2025-04-26 18:17:53,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,767 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-04-26 18:17:53,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,774 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-04-26 18:17:53,775 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 [2025-04-26 18:17:53,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,787 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-04-26 18:17:53,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,794 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-04-26 18:17:53,796 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 [2025-04-26 18:17:53,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:17:53,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:17:53,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:17:53,806 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-04-26 18:17:53,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,813 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-04-26 18:17:53,814 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 [2025-04-26 18:17:53,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,827 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-04-26 18:17:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,833 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-04-26 18:17:53,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:53,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,848 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-04-26 18:17:53,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,854 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-04-26 18:17:53,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:17:53,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,870 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,876 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-04-26 18:17:53,878 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 [2025-04-26 18:17:53,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,890 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:17:53,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-04-26 18:17:53,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,897 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-04-26 18:17:53,898 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 [2025-04-26 18:17:53,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:17:53,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:17:53,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:17:53,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:17:53,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:17:53,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:17:53,917 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:17:53,936 INFO L436 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-04-26 18:17:53,936 INFO L437 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-04-26 18:17:53,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:17:53,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:53,938 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:53,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-04-26 18:17:53,940 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:17:53,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,956 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:17:53,956 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:17:53,956 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thrThread1of2ForFork0_~c~0#1, v_rep(select #length ~data~0.base)_2) = -2*thrThread1of2ForFork0_~c~0#1 + 1*v_rep(select #length ~data~0.base)_2 Supporting invariants [1*~data~0.offset >= 0] [2025-04-26 18:17:53,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:53,976 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2025-04-26 18:17:53,979 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 18:17:53,979 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 18:17:53,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:54,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:17:54,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:17:54,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:54,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:54,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:17:54,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:17:54,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:17:54,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:17:54,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:54,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:54,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 18:17:54,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:17:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:17:54,219 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-04-26 18:17:54,219 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 745 states and 963 transitions. cyclomatic complexity: 271 Second operand has 6 states, 6 states have (on average 10.0) internal successors, (in total 60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:54,311 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 745 states and 963 transitions. cyclomatic complexity: 271. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (in total 60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1279 states and 1753 transitions. Complement of second has 8 states. [2025-04-26 18:17:54,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:17:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.0) internal successors, (in total 60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2025-04-26 18:17:54,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 143 transitions. Stem has 54 letters. Loop has 9 letters. [2025-04-26 18:17:54,314 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:17:54,314 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 143 transitions. Stem has 63 letters. Loop has 9 letters. [2025-04-26 18:17:54,315 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:17:54,315 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 143 transitions. Stem has 54 letters. Loop has 18 letters. [2025-04-26 18:17:54,315 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:17:54,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1753 transitions. [2025-04-26 18:17:54,322 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 139 [2025-04-26 18:17:54,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 998 states and 1351 transitions. [2025-04-26 18:17:54,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 692 [2025-04-26 18:17:54,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 739 [2025-04-26 18:17:54,328 INFO L74 IsDeterministic]: Start isDeterministic. Operand 998 states and 1351 transitions. [2025-04-26 18:17:54,328 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:17:54,328 INFO L218 hiAutomatonCegarLoop]: Abstraction has 998 states and 1351 transitions. [2025-04-26 18:17:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states and 1351 transitions. [2025-04-26 18:17:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 954. [2025-04-26 18:17:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 954 states have (on average 1.3553459119496856) internal successors, (in total 1293), 953 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1293 transitions. [2025-04-26 18:17:54,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 954 states and 1293 transitions. [2025-04-26 18:17:54,340 INFO L438 stractBuchiCegarLoop]: Abstraction has 954 states and 1293 transitions. [2025-04-26 18:17:54,340 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:17:54,340 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 954 states and 1293 transitions. [2025-04-26 18:17:54,343 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 139 [2025-04-26 18:17:54,343 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:54,343 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:54,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:17:54,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:54,344 INFO L752 eck$LassoCheckResult]: Stem: "[290] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[302] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[316] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[335] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[309] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[292] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[270] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[272] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[322] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[297] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[273] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[277] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[310] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[321] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[308] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[263] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[285] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[324] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[294] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[298] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[331] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[313] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[326] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[296] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[275] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[283] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[282] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[334] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[307] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[289] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[268] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[329] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[265] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[276] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[314] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[400] L1060-2-->$Ultimate##0: Formula: (and (= v_thrThread1of2ForFork0_thidvar1_2 0) (= |v_thrThread1of2ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of2ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre8#1_18| v_thrThread1of2ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_18|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_4|, thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_6|, thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_6|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_18|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_20|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_4|, thrThread1of2ForFork0_#res#1.offset=|v_thrThread1of2ForFork0_#res#1.offset_4|, thrThread1of2ForFork0_thidvar1=v_thrThread1of2ForFork0_thidvar1_2, thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_2, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of2ForFork0_#res#1.base=|v_thrThread1of2ForFork0_#res#1.base_4|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_4|, thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_14|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_4|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_#t~ret4#1, thrThread1of2ForFork0_#t~ret5#1, thrThread1of2ForFork0_~c~0#1, thrThread1of2ForFork0_#in~arg#1.base, thrThread1of2ForFork0_#res#1.offset, thrThread1of2ForFork0_thidvar1, thrThread1of2ForFork0_thidvar0, thrThread1of2ForFork0___VERIFIER_assert_~cond#1, thrThread1of2ForFork0_#res#1.base, thrThread1of2ForFork0_~arg#1.base, thrThread1of2ForFork0_~end~0#1, thrThread1of2ForFork0_#in~arg#1.offset]" "[368] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of2ForFork0_~arg#1.base_1| |v_thrThread1of2ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of2ForFork0_~arg#1.offset_1| |v_thrThread1of2ForFork0_#in~arg#1.offset_1|)) InVars {thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} OutVars{thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_1|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_1|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_~arg#1.base]" "[369] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" "[370] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1]" "[371] L1038-->L1039: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" "[372] L1039-->L1040: Formula: (= |v_thrThread1of2ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1]" "[315] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[317] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[276] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[314] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[401] L1060-2-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_20| v_thrThread2of2ForFork0_thidvar0_2) (= v_thrThread2of2ForFork0_thidvar1_2 0) (= |v_thrThread2of2ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread2of2ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_20|} OutVars{thrThread2of2ForFork0_thidvar1=v_thrThread2of2ForFork0_thidvar1_2, thrThread2of2ForFork0_#t~ret5#1=|v_thrThread2of2ForFork0_#t~ret5#1_6|, thrThread2of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of2ForFork0___VERIFIER_assert_~cond#1_12|, thrThread2of2ForFork0_#in~arg#1.offset=|v_thrThread2of2ForFork0_#in~arg#1.offset_4|, thrThread2of2ForFork0_~end~0#1=|v_thrThread2of2ForFork0_~end~0#1_14|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_20|, thrThread2of2ForFork0_#res#1.base=|v_thrThread2of2ForFork0_#res#1.base_4|, thrThread2of2ForFork0_~arg#1.base=|v_thrThread2of2ForFork0_~arg#1.base_4|, thrThread2of2ForFork0_~arg#1.offset=|v_thrThread2of2ForFork0_~arg#1.offset_4|, thrThread2of2ForFork0_#res#1.offset=|v_thrThread2of2ForFork0_#res#1.offset_4|, thrThread2of2ForFork0_#t~ret4#1=|v_thrThread2of2ForFork0_#t~ret4#1_6|, thrThread2of2ForFork0_thidvar0=v_thrThread2of2ForFork0_thidvar0_2, thrThread2of2ForFork0_~c~0#1=|v_thrThread2of2ForFork0_~c~0#1_20|, thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread2of2ForFork0_#in~arg#1.base=|v_thrThread2of2ForFork0_#in~arg#1.base_4|} AuxVars[] AssignedVars[thrThread2of2ForFork0_thidvar1, thrThread2of2ForFork0_#t~ret5#1, thrThread2of2ForFork0___VERIFIER_assert_~cond#1, thrThread2of2ForFork0_#in~arg#1.offset, thrThread2of2ForFork0_~end~0#1, thrThread2of2ForFork0_#res#1.base, thrThread2of2ForFork0_~arg#1.base, thrThread2of2ForFork0_~arg#1.offset, thrThread2of2ForFork0_#res#1.offset, thrThread2of2ForFork0_#t~ret4#1, thrThread2of2ForFork0_thidvar0, thrThread2of2ForFork0_~c~0#1, thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of2ForFork0_#in~arg#1.base]" "[338] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread2of2ForFork0_~arg#1.offset_1| |v_thrThread2of2ForFork0_#in~arg#1.offset_1|) (= |v_thrThread2of2ForFork0_~arg#1.base_1| |v_thrThread2of2ForFork0_#in~arg#1.base_1|)) InVars {thrThread2of2ForFork0_#in~arg#1.offset=|v_thrThread2of2ForFork0_#in~arg#1.offset_1|, thrThread2of2ForFork0_#in~arg#1.base=|v_thrThread2of2ForFork0_#in~arg#1.base_1|} OutVars{thrThread2of2ForFork0_#in~arg#1.offset=|v_thrThread2of2ForFork0_#in~arg#1.offset_1|, thrThread2of2ForFork0_~arg#1.base=|v_thrThread2of2ForFork0_~arg#1.base_1|, thrThread2of2ForFork0_~arg#1.offset=|v_thrThread2of2ForFork0_~arg#1.offset_1|, thrThread2of2ForFork0_#in~arg#1.base=|v_thrThread2of2ForFork0_#in~arg#1.base_1|} AuxVars[] AssignedVars[thrThread2of2ForFork0_~arg#1.base, thrThread2of2ForFork0_~arg#1.offset]" "[339] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread2of2ForFork0_~c~0#1=|v_thrThread2of2ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread2of2ForFork0_~c~0#1]" "[340] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread2of2ForFork0_~end~0#1=|v_thrThread2of2ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread2of2ForFork0_~end~0#1]" "[341] L1038-->L1039: Formula: (= |v_thrThread2of2ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread2of2ForFork0_~c~0#1=|v_thrThread2of2ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread2of2ForFork0_~c~0#1]" "[342] L1039-->L1040: Formula: (= |v_thrThread2of2ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread2of2ForFork0_~end~0#1=|v_thrThread2of2ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread2of2ForFork0_~end~0#1]" "[315] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[317] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[265] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[276] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[314] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[398] L1060-2-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:17:54,344 INFO L754 eck$LassoCheckResult]: Loop: "[399] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:17:54,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1062188836, now seen corresponding path program 1 times [2025-04-26 18:17:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:54,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038117797] [2025-04-26 18:17:54,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:54,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-26 18:17:54,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-26 18:17:54,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:54,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:54,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:54,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-26 18:17:54,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-26 18:17:54,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:54,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:54,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:54,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:54,363 INFO L85 PathProgramCache]: Analyzing trace with hash 430, now seen corresponding path program 1 times [2025-04-26 18:17:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:54,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288498828] [2025-04-26 18:17:54,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:54,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:54,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:54,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:54,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:54,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:54,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:54,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:54,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:54,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:54,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:54,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1431884851, now seen corresponding path program 1 times [2025-04-26 18:17:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:54,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391207391] [2025-04-26 18:17:54,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:54,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:54,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-26 18:17:54,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-26 18:17:54,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:54,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:54,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:54,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-26 18:17:54,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-26 18:17:54,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:54,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:54,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:54,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-26 18:17:54,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-26 18:17:54,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:54,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:54,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:54,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-26 18:17:54,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-26 18:17:54,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:54,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:54,836 WARN L166 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:17:54,849 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:17:54,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:54,857 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:17:54,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:17:54,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:54,859 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:54,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (84)] Waiting until timeout for monitored process [2025-04-26 18:17:54,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 139 transitions, 296 flow [2025-04-26 18:17:54,902 INFO L116 PetriNetUnfolderBase]: 11/167 cut-off events. [2025-04-26 18:17:54,902 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-26 18:17:54,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 167 events. 11/167 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 379 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 129. Up to 4 conditions per place. [2025-04-26 18:17:54,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 139 transitions, 296 flow [2025-04-26 18:17:54,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 139 transitions, 296 flow [2025-04-26 18:17:54,908 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 135 places, 139 transitions, 296 flow [2025-04-26 18:17:54,908 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 135 places, 139 transitions, 296 flow [2025-04-26 18:18:00,423 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 272398 states, 272383 states have (on average 4.177679958000316) internal successors, (in total 1137929), 272397 states have internal predecessors, (1137929), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:00,884 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 272398 states, 272383 states have (on average 4.177679958000316) internal successors, (in total 1137929), 272397 states have internal predecessors, (1137929), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:00,884 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:18:01,181 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 467276#[thrEXIT, thrEXIT, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,226 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 504454#[thrEXIT, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,267 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 467268#[thrEXIT, thrFINAL, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,269 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 504468#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrFINAL, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,277 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 451814#[thrEXIT, thrFINAL, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,313 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220592#[thrEXIT, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,323 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376296#[thrEXIT, L1043-1, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,323 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354798#[thrEXIT, L1043, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,324 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332674#[thrEXIT, L1042, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,324 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310282#[thrEXIT, L1041, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,324 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264912#[thrEXIT, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,327 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354800#[thrEXIT, L1043-1, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,328 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332676#[thrEXIT, L1043, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,328 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310166#[thrEXIT, L1042, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,328 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287566#[thrEXIT, L1043, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,328 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242506#[thrEXIT, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,330 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332678#[thrEXIT, L1043-1, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,331 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310168#[thrEXIT, L1043, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,331 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287470#[thrEXIT, L1042, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,331 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264892#[thrEXIT, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,331 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220586#[thrEXIT, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,334 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310174#[thrEXIT, L1043-1, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,335 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287474#[thrEXIT, L1043, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,335 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264816#[thrEXIT, L1042, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,335 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242490#[thrEXIT, L1041, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,335 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199390#[thrEXIT, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,339 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220558#[thrEXIT, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,339 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264820#[thrEXIT, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,340 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242432#[thrEXIT, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,340 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220528#[thrEXIT, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,340 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199372#[thrEXIT, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,340 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159834#[thrEXIT, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,356 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 504710#[thrEXIT, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,360 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 527926#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,376 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 504672#[thrFINAL, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,378 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 527982#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrFINAL, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,381 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 493920#[thrFINAL, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,393 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287950#[L1041-2, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,397 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 435062#[L1043-1, L1043-1, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,397 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 416744#[L1043, L1043-1, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,397 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 397170#[L1042, L1043-1, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,397 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 377030#[L1041, L1043-1, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,397 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 333320#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,399 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 416756#[L1043-1, L1043, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,399 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 397186#[L1043, L1043, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,399 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376540#[L1042, L1043, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,399 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 355454#[L1043, L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,399 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310720#[L1043, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,400 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 397194#[L1043-1, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,401 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376546#[L1043, L1042, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,401 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 355036#[L1042, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,401 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 333240#[L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,401 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287930#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,402 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376614#[L1043-1, L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,403 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 355090#[L1043, L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,403 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332930#[L1042, L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,403 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310656#[L1041, L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,403 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 265202#[L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,405 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287836#[L1041-2, L1040, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,405 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332948#[L1043-1, L1040, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,405 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310408#[L1043, L1040, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,405 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287676#[L1042, L1040, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,405 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 265132#[L1041, L1040, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,405 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220762#[L1040, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,449 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 467266#[thrFINAL, thrEXIT, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,451 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 504472#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrEXIT, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,453 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 451818#[thrEXIT, thrFINAL, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,478 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 504442#[thrFINAL, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:01,480 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 527792#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrFINAL, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,482 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 493624#[thrFINAL, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,573 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 451804#[thrFINAL, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:01,582 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 493646#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrFINAL, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,602 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 434880#[thrFINAL, thrFINAL, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,792 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199388#[L1041-2, thrFINAL, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,853 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354810#[L1043-1, thrFINAL, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,854 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332686#[L1043, thrFINAL, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,855 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310176#[L1042, thrFINAL, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,862 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287564#[L1041, thrFINAL, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,862 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242504#[thrFINAL, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,906 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332688#[L1043-1, L1043, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,907 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310178#[L1043, L1043, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,908 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287478#[L1042, L1043, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,908 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264890#[L1041, L1043, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,909 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220584#[L1043, thrFINAL, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,944 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310180#[L1043-1, thrFINAL, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,945 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287480#[L1043, thrFINAL, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,946 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264822#[L1042, thrFINAL, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,946 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242484#[L1041, thrFINAL, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,947 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199384#[thrFINAL, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,983 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287486#[L1043-1, L1041, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,984 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264826#[L1043, thrFINAL, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,989 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242436#[L1042, L1041, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,990 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220568#[L1041, thrFINAL, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:01,991 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179086#[thrFINAL, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,024 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199364#[L1041-2, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,029 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242440#[L1043-1, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,030 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220534#[L1043, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,031 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199346#[L1042, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,033 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179072#[L1041, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,033 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141734#[L1040, thrFINAL, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,062 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 221042#[L1041-2, thrEXIT, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,063 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 288292#[L1041-2, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,070 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199770#[L1041-2, thrFINAL, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,074 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125000#[L1041-2, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,075 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 160086#[L1041-2, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,076 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141932#[L1041-2, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,076 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 124998#[L1041-2, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,077 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109326#[L1041-2, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,084 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 221008#[L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,085 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 288248#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,085 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199742#[L1041-2, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,086 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 124992#[L1041-2, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,087 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 160066#[L1043-1, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,087 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141916#[L1043, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,087 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 124986#[L1041-2, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,087 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109322#[L1041-2, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,087 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 81866#[L1041-2, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,099 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376064#[L1043-1, L1043-1, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,099 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354566#[L1043-1, L1043, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,099 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332444#[L1043-1, L1042, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,099 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 309992#[L1043-1, L1041, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,099 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264652#[L1043-1, thrEXIT, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,102 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 434636#[L1043-1, L1043-1, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,102 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 416300#[L1043-1, L1043, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,102 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 396712#[L1043-1, L1042, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,102 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376130#[L1043-1, L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,102 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332512#[L1043-1, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,124 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354568#[L1043-1, L1043-1, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,126 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332446#[L1043-1, L1043, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,127 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 309938#[L1043-1, L1042, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,128 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287292#[L1043-1, L1041, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,129 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242276#[L1043-1, thrFINAL, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,131 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159718#[L1043-1, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,133 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376074#[L1043-1, L1043-1, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,133 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 434656#[L1043-1, L1043-1, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,134 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354580#[L1043-1, L1043-1, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,135 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 309936#[L1043-1, L1043-1, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,135 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287246#[L1043-1, L1043, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,135 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264606#[L1043-1, L1042, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,135 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242268#[L1043-1, L1041, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,135 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199216#[L1043-1, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,137 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354576#[L1043-1, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,137 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 416322#[L1043-1, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:18:02,138 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332460#[L1043-1, L1043, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,138 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287248#[L1043-1, L1043-1, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,138 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264608#[L1043-1, L1043, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,138 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242236#[L1043-1, L1042, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,139 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220378#[L1043-1, L1043, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,139 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 178946#[L1043-1, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,141 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332456#[L1043-1, L1042, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,141 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 396736#[L1043-1, L1042, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,141 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 309950#[L1043-1, L1042, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,142 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264610#[L1043-1, L1043-1, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,142 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242238#[L1043-1, L1043, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,142 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220354#[L1043-1, L1042, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,142 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199208#[L1043-1, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,142 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159716#[L1043-1, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,144 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 309948#[L1043-1, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,144 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376086#[L1043-1, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:18:02,144 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287260#[L1043-1, L1041, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,145 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242244#[L1043-1, L1043-1, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,145 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220358#[L1043-1, L1043, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,145 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199192#[L1043-1, L1042, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,145 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 178940#[L1043-1, L1041, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,145 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141638#[L1043-1, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,147 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264618#[L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,147 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332468#[L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:18:02,147 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242248#[L1043-1, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,148 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159710#[L1043-1, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,148 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199196#[L1043-1, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,148 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 178930#[L1043-1, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,148 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159704#[L1043-1, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,148 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141634#[L1043-1, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,148 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109162#[L1043-1, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,152 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354642#[L1043-1, thrEXIT, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,152 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332522#[L1043, thrEXIT, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,152 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310012#[L1042, thrEXIT, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,152 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287372#[L1041, thrEXIT, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,152 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242342#[thrEXIT, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,153 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 416376#[L1043-1, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,153 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 396792#[L1043, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,154 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376140#[L1042, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,154 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354708#[L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,154 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310080#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,164 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332524#[L1043-1, thrFINAL, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,165 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310014#[L1043, thrFINAL, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,166 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287318#[L1042, thrFINAL, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,167 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264716#[L1041, thrFINAL, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,170 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220444#[thrFINAL, L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,172 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141670#[L1041-2, L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,174 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354652#[L1043-1, thrEXIT, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,174 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 416396#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1043-1, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,175 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332536#[L1043-1, thrFINAL, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,175 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287316#[L1043-1, L1043-1, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,176 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264670#[L1043, L1043-1, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,176 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242296#[L1042, L1043-1, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,176 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220436#[L1041, L1043-1, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,176 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 178990#[L1043-1, L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,177 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332532#[L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1043, thrEXIT]true [2025-04-26 18:18:02,178 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 396814#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1043, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,178 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310028#[L1043, L1043, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,178 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264672#[L1043-1, L1043, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,179 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242298#[L1043, L1043, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,179 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220404#[L1042, L1043, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,179 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199258#[L1043, L1041, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,179 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159754#[L1043, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,180 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310024#[L1042, thrEXIT, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,181 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376164#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1042, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,181 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287330#[L1042, thrFINAL, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,181 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242300#[L1043-1, L1042, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,181 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220406#[L1043, L1043, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,181 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199234#[L1042, L1042, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,181 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 178982#[L1041, L1042, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,182 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141668#[L1042, L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,183 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287328#[L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1043, thrEXIT]true [2025-04-26 18:18:02,184 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354664#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1041, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,184 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264684#[L1041, L1043, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,184 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220412#[L1043-1, L1041, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,184 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199238#[L1043, L1041, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,185 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 178966#[L1042, L1041, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,185 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159748#[L1041, L1041, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,185 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 124798#[L1041, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,186 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242308#[L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1043, thrEXIT]true [2025-04-26 18:18:02,187 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310036#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,187 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220416#[L1040, L1043, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,187 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141662#[L1041-2, L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,188 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 178970#[L1043-1, L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,188 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159738#[L1043, L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,188 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141656#[L1042, L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,188 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 124794#[L1041, L1040, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,188 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 94838#[L1040, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,191 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332598#[L1043-1, thrEXIT, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,192 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310090#[L1043, L1042, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,192 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287392#[L1042, thrEXIT, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,192 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264796#[L1041, thrEXIT, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,192 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220510#[thrEXIT, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,193 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 396868#[L1043-1, L1042, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,193 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376220#[L1043, L1042, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,193 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354718#[L1042, L1042, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,193 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332664#[L1041, L1042, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,193 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287460#[L1042, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,204 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310092#[L1043-1, thrFINAL, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,205 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287394#[L1043, L1042, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,206 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264742#[L1042, thrFINAL, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,207 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242406#[L1041, thrFINAL, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,207 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199324#[thrFINAL, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,209 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 124830#[L1041-2, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,313 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332608#[L1042, L1043-1, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,314 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 396888#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1042, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,314 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310104#[L1042, L1043-1, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,315 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264740#[L1043-1, L1042, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,315 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242360#[L1043, L1042, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,315 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220464#[L1042, L1042, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,315 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199316#[L1041, L1042, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,315 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159798#[L1042, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,317 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 310100#[L1043, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,317 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 376242#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1043, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,317 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287408#[L1043, L1042, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,318 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242362#[L1043-1, L1043, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,318 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220466#[L1043, L1043, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,318 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199284#[L1042, L1043, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,318 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179032#[L1043, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,318 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141706#[L1043, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,319 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287404#[L1042, L1042, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,320 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 354742#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1042, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,320 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264754#[L1042, L1042, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,320 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220468#[L1043-1, L1042, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,320 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199286#[L1043, L1042, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,320 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179008#[L1042, L1042, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,320 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159790#[L1041, L1042, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,320 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 124828#[L1042, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,322 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 264752#[L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,322 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 332620#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,323 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 242374#[L1041, L1042, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,323 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199292#[L1043-1, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,324 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179012#[L1043, L1042, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,324 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159774#[L1042, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,324 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141700#[L1041, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,324 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109204#[L1041, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,326 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220476#[L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,327 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287416#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,327 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199296#[L1040, L1042, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,328 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 124822#[L1041-2, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,328 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159778#[L1043-1, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,328 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141690#[L1043, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,328 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 124816#[L1042, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,329 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109200#[L1041, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,329 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 81806#[L1040, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,334 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 311090#[L1043-1, L1041, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,334 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 288302#[L1043, L1041, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,334 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 265546#[L1042, L1041, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,334 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 243112#[L1041, L1041, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,335 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199836#[L1041, thrEXIT, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,336 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 377458#[L1043-1, L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,336 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 355892#[L1043, L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,337 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 333680#[L1042, L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,337 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 311156#[L1041, L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,337 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 265614#[L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,353 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 288304#[L1043-1, L1041, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,355 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 265548#[L1043, L1041, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,357 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 243058#[L1042, L1041, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,358 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 221106#[L1041, L1041, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,359 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179458#[L1041, thrFINAL, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,362 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109358#[L1041-2, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,365 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 311100#[L1041, L1043-1, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,366 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 377478#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1041, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,367 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 288316#[L1041, L1043-1, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,368 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 243056#[L1043-1, L1041, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,368 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 221060#[L1043, L1041, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,368 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199790#[L1042, L1041, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,368 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179450#[L1041, L1041, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,369 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141976#[L1041, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,371 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 288312#[L1043, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,371 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 355914#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1043, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,372 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 265562#[L1043, L1041, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,372 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 221062#[L1043-1, L1043, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,372 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199792#[L1043, L1041, L1043, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,373 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179418#[L1043, L1042, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,373 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 160128#[L1043, L1041, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,373 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125036#[L1043, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,375 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 265558#[L1041, L1042, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,375 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 333704#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,376 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 243070#[L1041, L1042, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,377 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199794#[L1043-1, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,377 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179420#[L1043, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,377 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 160104#[L1042, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,377 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141968#[L1041, L1041, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,377 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109356#[L1041, L1042, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,379 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 243068#[L1041, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,380 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 311112#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1041, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,380 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 221074#[L1041, L1041, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,381 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179426#[L1043-1, L1041, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,381 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 160108#[L1043, L1041, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,381 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141952#[L1042, L1041, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,381 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125030#[L1041, L1041, L1041, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,381 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 94966#[L1041, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,384 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199802#[L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,384 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 265570#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,385 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179430#[L1041, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,386 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109350#[L1041, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,386 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141956#[L1043-1, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,386 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125020#[L1043, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,386 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109344#[L1042, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,386 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 94962#[L1041, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,386 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 70098#[L1041, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,399 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 237430#[L1041-2, thrEXIT, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,399 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 283134#[L1043-1, thrEXIT, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,399 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 260088#[L1043, thrEXIT, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,399 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 237372#[L1042, thrEXIT, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,400 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 215276#[L1041, thrEXIT, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,400 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173490#[thrEXIT, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,402 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 306352#[L1041-2, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,402 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 351900#[L1043-1, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,402 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 329280#[L1043, L1040, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,402 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 306282#[L1042, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,402 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 283200#[L1041, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,402 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 237440#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,425 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 215272#[L1041-2, thrFINAL, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,427 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 260090#[L1043-1, thrFINAL, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,428 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 237374#[L1043, thrFINAL, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,430 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 215222#[L1042, thrFINAL, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,432 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 193900#[L1041, thrFINAL, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,433 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 154178#[thrFINAL, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,439 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 237386#[L1041-2, L1040, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,440 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 306308#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,440 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 215236#[L1041-2, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,441 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 136064#[L1041-2, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,441 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173454#[L1043-1, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,442 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 154144#[L1043, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,442 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 136044#[L1042, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,442 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 119246#[L1041-2, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,442 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 89596#[L1041-2, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,445 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 283144#[L1043-1, L1040, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,445 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 351920#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,446 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 260102#[L1043-1, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,446 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173478#[L1041-2, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,446 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 215220#[L1043-1, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,446 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 193854#[L1043, L1040, L1043-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,447 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173444#[L1042, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,447 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 154170#[L1041, L1043-1, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,447 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 119252#[L1043-1, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,449 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 260098#[L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,450 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 329302#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,450 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 237388#[L1043, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,451 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 154166#[L1043, L1041-2, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,451 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 193856#[L1043-1, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,451 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173446#[L1043, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,451 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 154138#[L1042, L1043, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,451 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 136066#[L1043, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,452 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 103752#[L1043, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,454 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 237384#[L1042, L1040, thrEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,455 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 306306#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,455 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 215234#[L1042, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,456 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 136062#[L1041-2, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,456 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173448#[L1043-1, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,456 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 154140#[L1043, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,456 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 136042#[L1042, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,456 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 119244#[L1041, L1040, L1042, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,456 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 89594#[L1042, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,459 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 215232#[L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,460 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 283156#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,460 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 193868#[L1041, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,461 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 119242#[L1041-2, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,461 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 154146#[L1043-1, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,461 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 136046#[L1043, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,461 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 119228#[L1042, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,461 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 103746#[L1041, L1041, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,461 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 76802#[L1041, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,464 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173456#[L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrEXIT]true [2025-04-26 18:18:02,465 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 237396#[thrErr0ASSERT_VIOLATIONERROR_FUNCTION, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,465 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 154150#[L1040, L1040, thrFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,466 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 89588#[L1041-2, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,466 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 119232#[L1043-1, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,466 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 103736#[L1043, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,466 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 89582#[L1042, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,466 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 76798#[L1041, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,467 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 55190#[L1040, L1040, L1040, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:18:02,467 WARN L140 AmpleReduction]: Number of pruned transitions: 47381 [2025-04-26 18:18:02,467 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 417 [2025-04-26 18:18:02,467 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1072 [2025-04-26 18:18:02,467 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:1560 [2025-04-26 18:18:02,467 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:17528 [2025-04-26 18:18:02,467 WARN L145 AmpleReduction]: Times succ was already a loop node:236 [2025-04-26 18:18:02,467 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1116 [2025-04-26 18:18:02,467 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:18:02,489 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 19744 states, 19729 states have (on average 1.4365654620102388) internal successors, (in total 28342), 19743 states have internal predecessors, (28342), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:02,489 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:18:02,489 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:18:02,489 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:18:02,489 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:18:02,489 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:18:02,489 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:18:02,489 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:18:02,489 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:18:02,506 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19744 states, 19729 states have (on average 1.4365654620102388) internal successors, (in total 28342), 19743 states have internal predecessors, (28342), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:02,653 INFO L131 ngComponentsAnalysis]: Automaton has 1226 accepting balls. 10835 [2025-04-26 18:18:02,653 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:18:02,653 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:18:02,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:02,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:02,655 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:18:02,671 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19744 states, 19729 states have (on average 1.4365654620102388) internal successors, (in total 28342), 19743 states have internal predecessors, (28342), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:02,801 INFO L131 ngComponentsAnalysis]: Automaton has 1226 accepting balls. 10835 [2025-04-26 18:18:02,801 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:18:02,801 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:18:02,802 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:02,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:02,803 INFO L752 eck$LassoCheckResult]: Stem: "[587] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[599] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[613] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[632] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[606] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[589] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[567] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[569] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[619] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[594] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[570] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[574] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[607] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[618] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[605] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[560] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[582] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[621] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[591] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[595] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[628] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[610] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[623] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[593] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[572] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[580] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[579] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[631] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[604] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[586] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[565] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[626] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[727] L1060-2-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_33| v_thrThread1of3ForFork0_thidvar0_2) (= v_thrThread1of3ForFork0_thidvar1_2 0) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_20|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_6|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_6|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_#t~ret5#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_#t~ret4#1, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1]" "[635] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of3ForFork0_~arg#1.base_1| |v_thrThread1of3ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_1| |v_thrThread1of3ForFork0_~arg#1.offset_1|)) InVars {thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_1|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset]" "[636] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[637] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[638] L1038-->L1039: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[639] L1039-->L1040: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[612] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[614] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[561] L1059-1-->L1062: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[]" "[640] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread1of3ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret4#1]" "[641] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_#t~ret4#1]" "[643] L1041-->L1041-2: Formula: (< v_~len~0_6 (+ v_~next~0_7 10)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[]" "[645] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of3ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret5#1]" "[647] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_#t~ret5#1]" [2025-04-26 18:18:02,803 INFO L754 eck$LassoCheckResult]: Loop: "[650] L1046-1-->L1047: Formula: (< |v_thrThread1of3ForFork0_~c~0#1_9| |v_thrThread1of3ForFork0_~end~0#1_11|) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[]" "[652] L1047-->L1047-1: Formula: (= (ite (and (< |v_thrThread1of3ForFork0_~c~0#1_11| v_~len~0_7) (<= 0 |v_thrThread1of3ForFork0_~c~0#1_11|)) 1 0) |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1]" "[654] L1047-1-->L1023: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[655] L1023-->L1024: Formula: (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3| |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|) InVars {thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[657] L1024-->L1024-2: Formula: (not (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[660] L1024-2-->L1047-2: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[662] L1047-2-->L1048: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1]" "[663] L1048-->L1048-1: Formula: (let ((.cse1 (* |v_thrThread1of3ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (select |v_#valid_7| v_~data~0.base_3) 1) (<= 0 .cse0) (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_6| v_~data~0.base_3))))) InVars {#memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} OutVars{#memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#memory_int]" "[664] L1048-1-->L1046-1: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_16| (+ |v_thrThread1of3ForFork0_~c~0#1_15| 1)) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_15|} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" [2025-04-26 18:18:02,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1920216119, now seen corresponding path program 1 times [2025-04-26 18:18:02,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:02,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734162366] [2025-04-26 18:18:02,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:02,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:02,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-26 18:18:02,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-26 18:18:02,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:02,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:18:02,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:18:02,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:18:02,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734162366] [2025-04-26 18:18:02,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734162366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:18:02,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:18:02,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:18:02,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355175516] [2025-04-26 18:18:02,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:18:02,823 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:18:02,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1563717776, now seen corresponding path program 1 times [2025-04-26 18:18:02,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:02,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967763339] [2025-04-26 18:18:02,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:02,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:02,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:02,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:02,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:02,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:02,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:02,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:02,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:02,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:02,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:02,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:02,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:18:02,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-26 18:18:02,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-26 18:18:02,896 INFO L87 Difference]: Start difference. First operand has 19744 states, 19729 states have (on average 1.4365654620102388) internal successors, (in total 28342), 19743 states have internal predecessors, (28342), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (in total 49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:18:02,958 INFO L93 Difference]: Finished difference Result 8635 states and 12416 transitions. [2025-04-26 18:18:02,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8635 states and 12416 transitions. [2025-04-26 18:18:03,003 INFO L131 ngComponentsAnalysis]: Automaton has 699 accepting balls. 3583 [2025-04-26 18:18:03,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8635 states to 8634 states and 12415 transitions. [2025-04-26 18:18:03,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8634 [2025-04-26 18:18:03,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8634 [2025-04-26 18:18:03,059 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8634 states and 12415 transitions. [2025-04-26 18:18:03,077 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:18:03,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8634 states and 12415 transitions. [2025-04-26 18:18:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8634 states and 12415 transitions. [2025-04-26 18:18:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8634 to 8634. [2025-04-26 18:18:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8634 states, 8634 states have (on average 1.4379198517488998) internal successors, (in total 12415), 8633 states have internal predecessors, (12415), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8634 states to 8634 states and 12415 transitions. [2025-04-26 18:18:03,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8634 states and 12415 transitions. [2025-04-26 18:18:03,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:18:03,236 INFO L438 stractBuchiCegarLoop]: Abstraction has 8634 states and 12415 transitions. [2025-04-26 18:18:03,236 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:18:03,236 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8634 states and 12415 transitions. [2025-04-26 18:18:03,271 INFO L131 ngComponentsAnalysis]: Automaton has 699 accepting balls. 3583 [2025-04-26 18:18:03,271 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:18:03,271 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:18:03,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:03,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:03,273 INFO L752 eck$LassoCheckResult]: Stem: "[587] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[599] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[613] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[632] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[606] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[589] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[567] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[569] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[619] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[594] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[570] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[574] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[607] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[618] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[605] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[560] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[582] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[621] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[591] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[595] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[628] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[610] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[623] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[593] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[572] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[580] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[579] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[631] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[604] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[586] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[565] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[626] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[727] L1060-2-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_33| v_thrThread1of3ForFork0_thidvar0_2) (= v_thrThread1of3ForFork0_thidvar1_2 0) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_20|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_6|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_6|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_#t~ret5#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_#t~ret4#1, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1]" "[635] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of3ForFork0_~arg#1.base_1| |v_thrThread1of3ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_1| |v_thrThread1of3ForFork0_~arg#1.offset_1|)) InVars {thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_1|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset]" "[636] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[637] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[638] L1038-->L1039: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[639] L1039-->L1040: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[612] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[614] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[640] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread1of3ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret4#1]" "[641] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_#t~ret4#1]" "[643] L1041-->L1041-2: Formula: (< v_~len~0_6 (+ v_~next~0_7 10)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[]" "[645] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of3ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret5#1]" "[647] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_#t~ret5#1]" [2025-04-26 18:18:03,273 INFO L754 eck$LassoCheckResult]: Loop: "[650] L1046-1-->L1047: Formula: (< |v_thrThread1of3ForFork0_~c~0#1_9| |v_thrThread1of3ForFork0_~end~0#1_11|) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[]" "[652] L1047-->L1047-1: Formula: (= (ite (and (< |v_thrThread1of3ForFork0_~c~0#1_11| v_~len~0_7) (<= 0 |v_thrThread1of3ForFork0_~c~0#1_11|)) 1 0) |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1]" "[654] L1047-1-->L1023: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[655] L1023-->L1024: Formula: (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3| |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|) InVars {thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[657] L1024-->L1024-2: Formula: (not (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[660] L1024-2-->L1047-2: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[662] L1047-2-->L1048: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1]" "[663] L1048-->L1048-1: Formula: (let ((.cse1 (* |v_thrThread1of3ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (select |v_#valid_7| v_~data~0.base_3) 1) (<= 0 .cse0) (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_6| v_~data~0.base_3))))) InVars {#memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} OutVars{#memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#memory_int]" "[664] L1048-1-->L1046-1: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_16| (+ |v_thrThread1of3ForFork0_~c~0#1_15| 1)) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_15|} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" [2025-04-26 18:18:03,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:03,273 INFO L85 PathProgramCache]: Analyzing trace with hash 39611472, now seen corresponding path program 1 times [2025-04-26 18:18:03,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:03,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912637323] [2025-04-26 18:18:03,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:03,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:03,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-26 18:18:03,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-26 18:18:03,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:03,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:03,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:03,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-26 18:18:03,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-26 18:18:03,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:03,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:03,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:03,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:03,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1563717776, now seen corresponding path program 2 times [2025-04-26 18:18:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:03,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833207997] [2025-04-26 18:18:03,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:18:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:03,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:03,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:03,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:18:03,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:03,303 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:03,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:03,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:03,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:03,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:03,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:03,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:03,308 INFO L85 PathProgramCache]: Analyzing trace with hash -430797823, now seen corresponding path program 1 times [2025-04-26 18:18:03,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:03,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447296393] [2025-04-26 18:18:03,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:03,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:03,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 18:18:03,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 18:18:03,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:03,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:18:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:18:03,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:18:03,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447296393] [2025-04-26 18:18:03,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447296393] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:18:03,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:18:03,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:18:03,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223859503] [2025-04-26 18:18:03,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:18:03,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:18:03,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:18:03,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:18:03,419 INFO L87 Difference]: Start difference. First operand 8634 states and 12415 transitions. cyclomatic complexity: 4480 Second operand has 4 states, 4 states have (on average 15.0) internal successors, (in total 60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:18:03,501 INFO L93 Difference]: Finished difference Result 10824 states and 15264 transitions. [2025-04-26 18:18:03,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10824 states and 15264 transitions. [2025-04-26 18:18:03,554 INFO L131 ngComponentsAnalysis]: Automaton has 836 accepting balls. 4210 [2025-04-26 18:18:03,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10824 states to 10824 states and 15264 transitions. [2025-04-26 18:18:03,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10824 [2025-04-26 18:18:03,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10824 [2025-04-26 18:18:03,620 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10824 states and 15264 transitions. [2025-04-26 18:18:03,637 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:18:03,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10824 states and 15264 transitions. [2025-04-26 18:18:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10824 states and 15264 transitions. [2025-04-26 18:18:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10824 to 9675. [2025-04-26 18:18:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9675 states, 9675 states have (on average 1.4285271317829458) internal successors, (in total 13821), 9674 states have internal predecessors, (13821), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9675 states to 9675 states and 13821 transitions. [2025-04-26 18:18:03,809 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9675 states and 13821 transitions. [2025-04-26 18:18:03,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:18:03,810 INFO L438 stractBuchiCegarLoop]: Abstraction has 9675 states and 13821 transitions. [2025-04-26 18:18:03,810 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:18:03,810 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9675 states and 13821 transitions. [2025-04-26 18:18:03,846 INFO L131 ngComponentsAnalysis]: Automaton has 713 accepting balls. 3737 [2025-04-26 18:18:03,846 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:18:03,846 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:18:03,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:03,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:03,847 INFO L752 eck$LassoCheckResult]: Stem: "[587] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[599] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[613] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[632] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[606] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[589] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[567] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[569] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[619] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[594] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[570] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[574] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[607] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[618] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[605] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[560] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[582] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[621] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[591] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[595] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[628] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[610] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[623] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[593] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[572] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[580] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[579] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[631] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[604] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[586] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[565] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[626] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[727] L1060-2-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_33| v_thrThread1of3ForFork0_thidvar0_2) (= v_thrThread1of3ForFork0_thidvar1_2 0) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_20|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_6|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_6|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_#t~ret5#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_#t~ret4#1, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1]" "[635] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of3ForFork0_~arg#1.base_1| |v_thrThread1of3ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_1| |v_thrThread1of3ForFork0_~arg#1.offset_1|)) InVars {thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_1|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset]" "[636] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[637] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[638] L1038-->L1039: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[639] L1039-->L1040: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[612] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[614] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[640] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread1of3ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret4#1]" "[641] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_#t~ret4#1]" "[642] L1041-->L1042: Formula: (<= (+ v_~next~0_3 10) v_~len~0_5) InVars {~next~0=v_~next~0_3, ~len~0=v_~len~0_5} OutVars{~next~0=v_~next~0_3, ~len~0=v_~len~0_5} AuxVars[] AssignedVars[]" "[644] L1042-->L1043: Formula: (= v_~next~0_4 |v_thrThread1of3ForFork0_~c~0#1_5|) InVars {~next~0=v_~next~0_4} OutVars{~next~0=v_~next~0_4, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_5|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[646] L1043-->L1043-1: Formula: (= (+ v_~next~0_5 10) |v_thrThread1of3ForFork0_~end~0#1_5|) InVars {~next~0=v_~next~0_5} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_5|, ~next~0=v_~next~0_5} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[648] L1043-1-->L1041-2: Formula: (= v_~next~0_6 |v_thrThread1of3ForFork0_~end~0#1_7|) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_7|} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_7|, ~next~0=v_~next~0_6} AuxVars[] AssignedVars[~next~0]" "[645] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of3ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret5#1]" "[647] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_#t~ret5#1]" [2025-04-26 18:18:03,847 INFO L754 eck$LassoCheckResult]: Loop: "[650] L1046-1-->L1047: Formula: (< |v_thrThread1of3ForFork0_~c~0#1_9| |v_thrThread1of3ForFork0_~end~0#1_11|) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[]" "[652] L1047-->L1047-1: Formula: (= (ite (and (< |v_thrThread1of3ForFork0_~c~0#1_11| v_~len~0_7) (<= 0 |v_thrThread1of3ForFork0_~c~0#1_11|)) 1 0) |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1]" "[654] L1047-1-->L1023: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[655] L1023-->L1024: Formula: (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3| |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|) InVars {thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[657] L1024-->L1024-2: Formula: (not (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[660] L1024-2-->L1047-2: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[662] L1047-2-->L1048: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1]" "[663] L1048-->L1048-1: Formula: (let ((.cse1 (* |v_thrThread1of3ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (select |v_#valid_7| v_~data~0.base_3) 1) (<= 0 .cse0) (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_6| v_~data~0.base_3))))) InVars {#memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} OutVars{#memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#memory_int]" "[664] L1048-1-->L1046-1: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_16| (+ |v_thrThread1of3ForFork0_~c~0#1_15| 1)) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_15|} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" [2025-04-26 18:18:03,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1079583141, now seen corresponding path program 1 times [2025-04-26 18:18:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:03,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295718930] [2025-04-26 18:18:03,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:03,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:03,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:18:03,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:18:03,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:03,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:03,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:03,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:18:03,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:18:03,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:03,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:03,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:03,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1563717776, now seen corresponding path program 3 times [2025-04-26 18:18:03,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:03,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553344374] [2025-04-26 18:18:03,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:18:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:03,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:03,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:03,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:18:03,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:03,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:03,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:03,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:03,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:03,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:03,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:03,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1345309098, now seen corresponding path program 1 times [2025-04-26 18:18:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:03,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11918943] [2025-04-26 18:18:03,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:03,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:03,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 18:18:03,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 18:18:03,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:03,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:03,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:03,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 18:18:03,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 18:18:03,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:03,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:03,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:04,377 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:18:04,377 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:18:04,377 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:18:04,377 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:18:04,377 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:18:04,377 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:04,377 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:18:04,377 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:18:04,377 INFO L132 ssoRankerPreferences]: Filename of dumped script: sssc12.i_petrified3_Iteration3_Lasso [2025-04-26 18:18:04,377 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:18:04,377 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:18:04,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:04,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:05,039 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:18:05,039 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:18:05,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,041 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-04-26 18:18:05,044 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 [2025-04-26 18:18:05,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,056 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-04-26 18:18:05,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,063 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-04-26 18:18:05,064 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 [2025-04-26 18:18:05,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,078 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,085 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-04-26 18:18:05,086 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 [2025-04-26 18:18:05,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,099 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-04-26 18:18:05,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,105 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-04-26 18:18:05,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:05,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,120 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-04-26 18:18:05,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,126 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-04-26 18:18:05,128 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 [2025-04-26 18:18:05,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,140 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-04-26 18:18:05,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,146 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-04-26 18:18:05,148 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 [2025-04-26 18:18:05,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,160 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,166 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-04-26 18:18:05,168 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 [2025-04-26 18:18:05,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:05,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:05,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:05,178 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-04-26 18:18:05,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,185 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-04-26 18:18:05,186 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 [2025-04-26 18:18:05,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,198 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-04-26 18:18:05,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,205 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-04-26 18:18:05,206 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 [2025-04-26 18:18:05,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,218 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-04-26 18:18:05,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,225 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-04-26 18:18:05,226 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 [2025-04-26 18:18:05,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:05,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:05,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:05,237 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,243 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-04-26 18:18:05,245 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 [2025-04-26 18:18:05,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,257 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,264 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-04-26 18:18:05,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:05,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,277 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-04-26 18:18:05,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,284 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-04-26 18:18:05,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:05,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,297 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-04-26 18:18:05,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,304 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-04-26 18:18:05,305 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 [2025-04-26 18:18:05,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:05,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:05,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:05,316 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-04-26 18:18:05,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,322 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-04-26 18:18:05,324 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 [2025-04-26 18:18:05,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,336 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-04-26 18:18:05,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,342 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-04-26 18:18:05,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:05,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,356 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,362 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-04-26 18:18:05,363 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 [2025-04-26 18:18:05,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,375 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-04-26 18:18:05,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,382 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-04-26 18:18:05,383 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 [2025-04-26 18:18:05,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,395 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-04-26 18:18:05,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,402 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-04-26 18:18:05,403 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 [2025-04-26 18:18:05,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,415 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,423 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-04-26 18:18:05,425 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 [2025-04-26 18:18:05,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:05,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:05,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:05,435 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-04-26 18:18:05,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,441 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-04-26 18:18:05,443 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 [2025-04-26 18:18:05,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:05,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:05,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:05,453 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-04-26 18:18:05,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,460 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-04-26 18:18:05,462 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 [2025-04-26 18:18:05,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,474 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-04-26 18:18:05,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,480 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-04-26 18:18:05,481 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 [2025-04-26 18:18:05,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:05,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:05,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:05,492 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-04-26 18:18:05,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,499 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-04-26 18:18:05,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:05,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,512 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-04-26 18:18:05,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,519 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-04-26 18:18:05,520 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 [2025-04-26 18:18:05,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,532 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-04-26 18:18:05,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,539 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-04-26 18:18:05,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:05,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,552 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-04-26 18:18:05,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,559 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-04-26 18:18:05,560 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 [2025-04-26 18:18:05,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,572 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,579 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-04-26 18:18:05,581 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 [2025-04-26 18:18:05,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,593 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-04-26 18:18:05,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,599 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-04-26 18:18:05,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:05,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:05,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:05,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:05,611 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-04-26 18:18:05,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,618 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-04-26 18:18:05,619 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 [2025-04-26 18:18:05,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,631 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-04-26 18:18:05,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,638 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-04-26 18:18:05,639 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 [2025-04-26 18:18:05,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,651 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-04-26 18:18:05,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,658 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-04-26 18:18:05,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:05,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,672 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-04-26 18:18:05,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,679 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-04-26 18:18:05,681 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 [2025-04-26 18:18:05,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:05,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:05,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:05,691 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-04-26 18:18:05,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,698 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-04-26 18:18:05,699 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 [2025-04-26 18:18:05,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,712 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-04-26 18:18:05,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,718 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-04-26 18:18:05,719 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 [2025-04-26 18:18:05,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,731 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-04-26 18:18:05,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,738 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-04-26 18:18:05,739 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 [2025-04-26 18:18:05,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,751 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-04-26 18:18:05,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,758 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-04-26 18:18:05,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 [2025-04-26 18:18:05,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,771 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-04-26 18:18:05,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,778 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-04-26 18:18:05,779 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 [2025-04-26 18:18:05,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,791 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-04-26 18:18:05,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,798 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-04-26 18:18:05,799 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 [2025-04-26 18:18:05,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,811 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,821 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-04-26 18:18:05,824 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 [2025-04-26 18:18:05,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,836 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,843 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-04-26 18:18:05,846 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 [2025-04-26 18:18:05,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,859 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,867 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-04-26 18:18:05,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:05,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,882 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:05,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,889 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-04-26 18:18:05,892 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 [2025-04-26 18:18:05,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:05,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:05,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:05,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:05,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:05,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:05,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:18:05,940 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 18:18:05,940 INFO L437 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 18:18:05,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:05,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:05,943 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:05,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-04-26 18:18:05,946 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:18:05,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,962 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:18:05,962 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:18:05,962 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_~c~0#1) = 1*thrThread1of3ForFork0_~end~0#1 - 1*thrThread1of3ForFork0_~c~0#1 Supporting invariants [] [2025-04-26 18:18:05,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:05,986 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-04-26 18:18:05,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:06,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 18:18:06,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 18:18:06,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:06,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:18:06,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:18:06,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:18:06,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:06,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:06,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:06,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:18:06,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:18:06,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:18:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:18:06,077 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 [2025-04-26 18:18:06,077 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9675 states and 13821 transitions. cyclomatic complexity: 4859 Second operand has 3 states, 3 states have (on average 20.0) internal successors, (in total 60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:06,192 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9675 states and 13821 transitions. cyclomatic complexity: 4859. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (in total 60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 15929 states and 24196 transitions. Complement of second has 6 states. [2025-04-26 18:18:06,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:18:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (in total 60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 288 transitions. [2025-04-26 18:18:06,193 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 288 transitions. Stem has 54 letters. Loop has 9 letters. [2025-04-26 18:18:06,194 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:18:06,194 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 288 transitions. Stem has 63 letters. Loop has 9 letters. [2025-04-26 18:18:06,194 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:18:06,194 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 288 transitions. Stem has 54 letters. Loop has 18 letters. [2025-04-26 18:18:06,194 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:18:06,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15929 states and 24196 transitions. [2025-04-26 18:18:06,262 INFO L131 ngComponentsAnalysis]: Automaton has 685 accepting balls. 2677 [2025-04-26 18:18:06,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15929 states to 12984 states and 19610 transitions. [2025-04-26 18:18:06,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9434 [2025-04-26 18:18:06,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10071 [2025-04-26 18:18:06,334 INFO L74 IsDeterministic]: Start isDeterministic. Operand 12984 states and 19610 transitions. [2025-04-26 18:18:06,334 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:18:06,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12984 states and 19610 transitions. [2025-04-26 18:18:06,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12984 states and 19610 transitions. [2025-04-26 18:18:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12984 to 12300. [2025-04-26 18:18:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12300 states, 12300 states have (on average 1.4980487804878049) internal successors, (in total 18426), 12299 states have internal predecessors, (18426), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12300 states to 12300 states and 18426 transitions. [2025-04-26 18:18:06,632 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12300 states and 18426 transitions. [2025-04-26 18:18:06,632 INFO L438 stractBuchiCegarLoop]: Abstraction has 12300 states and 18426 transitions. [2025-04-26 18:18:06,632 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:18:06,632 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12300 states and 18426 transitions. [2025-04-26 18:18:06,662 INFO L131 ngComponentsAnalysis]: Automaton has 685 accepting balls. 2677 [2025-04-26 18:18:06,662 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:18:06,662 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:18:06,663 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:06,663 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:06,664 INFO L752 eck$LassoCheckResult]: Stem: "[587] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[599] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[613] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[632] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[606] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[589] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[567] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[569] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[619] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[594] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[570] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[574] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[607] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[618] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[605] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[560] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[582] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[621] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[591] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[595] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[628] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[610] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[623] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[593] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[572] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[580] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[579] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[631] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[604] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[586] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[565] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[626] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[727] L1060-2-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_33| v_thrThread1of3ForFork0_thidvar0_2) (= v_thrThread1of3ForFork0_thidvar1_2 0) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_20|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_6|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_6|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_#t~ret5#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_#t~ret4#1, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1]" "[635] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of3ForFork0_~arg#1.base_1| |v_thrThread1of3ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_1| |v_thrThread1of3ForFork0_~arg#1.offset_1|)) InVars {thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_1|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset]" "[636] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[637] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[638] L1038-->L1039: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[639] L1039-->L1040: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[612] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[614] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[728] L1060-2-->$Ultimate##0: Formula: (and (= v_thrThread2of3ForFork0_thidvar1_2 0) (= |v_thrThread2of3ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre8#1_35| v_thrThread2of3ForFork0_thidvar0_2) (= |v_thrThread2of3ForFork0_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_35|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_12|, thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_4|, thrThread2of3ForFork0_thidvar1=v_thrThread2of3ForFork0_thidvar1_2, thrThread2of3ForFork0_thidvar0=v_thrThread2of3ForFork0_thidvar0_2, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_14|, thrThread2of3ForFork0_~arg#1.offset=|v_thrThread2of3ForFork0_~arg#1.offset_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_35|, thrThread2of3ForFork0_#res#1.offset=|v_thrThread2of3ForFork0_#res#1.offset_4|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_4|, thrThread2of3ForFork0_~arg#1.base=|v_thrThread2of3ForFork0_~arg#1.base_4|, thrThread2of3ForFork0_#t~ret4#1=|v_thrThread2of3ForFork0_#t~ret4#1_6|, thrThread2of3ForFork0_#res#1.base=|v_thrThread2of3ForFork0_#res#1.base_4|, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_20|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread2of3ForFork0_#t~ret5#1=|v_thrThread2of3ForFork0_#t~ret5#1_6|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_#in~arg#1.base, thrThread2of3ForFork0_thidvar1, thrThread2of3ForFork0_thidvar0, thrThread2of3ForFork0_~end~0#1, thrThread2of3ForFork0_~arg#1.offset, thrThread2of3ForFork0_#res#1.offset, thrThread2of3ForFork0_#in~arg#1.offset, thrThread2of3ForFork0_~arg#1.base, thrThread2of3ForFork0_#t~ret4#1, thrThread2of3ForFork0_#res#1.base, thrThread2of3ForFork0_~c~0#1, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_#t~ret5#1]" "[695] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread2of3ForFork0_~arg#1.offset_1| |v_thrThread2of3ForFork0_#in~arg#1.offset_1|) (= |v_thrThread2of3ForFork0_~arg#1.base_1| |v_thrThread2of3ForFork0_#in~arg#1.base_1|)) InVars {thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_1|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread2of3ForFork0_~arg#1.offset=|v_thrThread2of3ForFork0_~arg#1.offset_1|, thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_1|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_1|, thrThread2of3ForFork0_~arg#1.base=|v_thrThread2of3ForFork0_~arg#1.base_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~arg#1.offset, thrThread2of3ForFork0_~arg#1.base]" "[696] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1]" "[697] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~end~0#1]" "[698] L1038-->L1039: Formula: (= |v_thrThread2of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1]" "[699] L1039-->L1040: Formula: (= |v_thrThread2of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~end~0#1]" "[612] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[614] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[700] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread2of3ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread2of3ForFork0_#t~ret4#1=|v_thrThread2of3ForFork0_#t~ret4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret4#1]" "[701] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread2of3ForFork0_#t~ret4#1=|v_thrThread2of3ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_#t~ret4#1]" "[703] L1041-->L1041-2: Formula: (< v_~len~0_6 (+ v_~next~0_7 10)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[]" "[705] L1041-2-->L1045-2: Formula: (and (= |v_thrThread2of3ForFork0_#t~ret5#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0)))) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret5#1=|v_thrThread2of3ForFork0_#t~ret5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret5#1]" "[707] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread2of3ForFork0_#t~ret5#1=|v_thrThread2of3ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_#t~ret5#1]" [2025-04-26 18:18:06,664 INFO L754 eck$LassoCheckResult]: Loop: "[710] L1046-1-->L1047: Formula: (< |v_thrThread2of3ForFork0_~c~0#1_9| |v_thrThread2of3ForFork0_~end~0#1_11|) InVars {thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_9|, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_11|} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_9|, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_11|} AuxVars[] AssignedVars[]" "[712] L1047-->L1047-1: Formula: (= (ite (and (<= 0 |v_thrThread2of3ForFork0_~c~0#1_11|) (< |v_thrThread2of3ForFork0_~c~0#1_11| v_~len~0_7)) 1 0) |v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_11|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1]" "[714] L1047-1-->L1023: Formula: true InVars {} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1]" "[715] L1023-->L1024: Formula: (= |v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_3| |v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_3|) InVars {thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_3|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1]" "[717] L1024-->L1024-2: Formula: (not (= |v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[720] L1024-2-->L1047-2: Formula: true InVars {} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1]" "[722] L1047-2-->L1048: Formula: true InVars {} OutVars{thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1]" "[723] L1048-->L1048-1: Formula: (let ((.cse1 (* |v_thrThread2of3ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= 0 .cse0) (= (select |v_#valid_7| v_~data~0.base_3) 1) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_6| v_~data~0.base_3))))) InVars {#memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_13|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} OutVars{#memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_13|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#memory_int]" "[724] L1048-1-->L1046-1: Formula: (= |v_thrThread2of3ForFork0_~c~0#1_16| (+ |v_thrThread2of3ForFork0_~c~0#1_15| 1)) InVars {thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_15|} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1]" [2025-04-26 18:18:06,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1744377057, now seen corresponding path program 1 times [2025-04-26 18:18:06,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:06,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357677914] [2025-04-26 18:18:06,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:06,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:06,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-26 18:18:06,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-26 18:18:06,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:06,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:06,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:06,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-26 18:18:06,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-26 18:18:06,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:06,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:06,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:06,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1956744788, now seen corresponding path program 1 times [2025-04-26 18:18:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:06,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281006042] [2025-04-26 18:18:06,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:06,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:06,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:06,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:06,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:06,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:06,682 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:06,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:06,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:06,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:06,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:06,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:06,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1517606834, now seen corresponding path program 1 times [2025-04-26 18:18:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:06,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016998223] [2025-04-26 18:18:06,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:06,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:06,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-26 18:18:06,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-26 18:18:06,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:06,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:18:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:18:06,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:18:06,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016998223] [2025-04-26 18:18:06,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016998223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:18:06,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:18:06,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:18:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428137012] [2025-04-26 18:18:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:18:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:18:06,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:18:06,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:18:06,766 INFO L87 Difference]: Start difference. First operand 12300 states and 18426 transitions. cyclomatic complexity: 6915 Second operand has 4 states, 4 states have (on average 17.0) internal successors, (in total 68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:18:06,841 INFO L93 Difference]: Finished difference Result 15389 states and 22601 transitions. [2025-04-26 18:18:06,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15389 states and 22601 transitions. [2025-04-26 18:18:06,898 INFO L131 ngComponentsAnalysis]: Automaton has 817 accepting balls. 3033 [2025-04-26 18:18:06,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15389 states to 15373 states and 22583 transitions. [2025-04-26 18:18:06,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11664 [2025-04-26 18:18:06,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11664 [2025-04-26 18:18:06,964 INFO L74 IsDeterministic]: Start isDeterministic. Operand 15373 states and 22583 transitions. [2025-04-26 18:18:06,965 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:18:06,965 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15373 states and 22583 transitions. [2025-04-26 18:18:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15373 states and 22583 transitions. [2025-04-26 18:18:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15373 to 13790. [2025-04-26 18:18:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13790 states, 13790 states have (on average 1.4892675852066715) internal successors, (in total 20537), 13789 states have internal predecessors, (20537), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13790 states to 13790 states and 20537 transitions. [2025-04-26 18:18:07,148 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13790 states and 20537 transitions. [2025-04-26 18:18:07,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:18:07,149 INFO L438 stractBuchiCegarLoop]: Abstraction has 13790 states and 20537 transitions. [2025-04-26 18:18:07,149 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:18:07,149 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13790 states and 20537 transitions. [2025-04-26 18:18:07,184 INFO L131 ngComponentsAnalysis]: Automaton has 695 accepting balls. 2759 [2025-04-26 18:18:07,184 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:18:07,184 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:18:07,184 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:07,184 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:07,185 INFO L752 eck$LassoCheckResult]: Stem: "[587] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[599] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[613] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[632] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[606] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[589] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[567] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[569] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[619] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[594] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[570] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[574] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[607] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[618] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[605] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[560] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[582] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[621] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[591] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[595] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[628] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[610] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[623] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[593] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[572] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[580] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[579] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[631] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[604] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[586] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[565] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[626] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[727] L1060-2-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_33| v_thrThread1of3ForFork0_thidvar0_2) (= v_thrThread1of3ForFork0_thidvar1_2 0) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_20|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_6|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_6|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_#t~ret5#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_#t~ret4#1, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1]" "[635] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of3ForFork0_~arg#1.base_1| |v_thrThread1of3ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_1| |v_thrThread1of3ForFork0_~arg#1.offset_1|)) InVars {thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_1|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset]" "[636] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[637] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[638] L1038-->L1039: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[639] L1039-->L1040: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[612] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[614] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[728] L1060-2-->$Ultimate##0: Formula: (and (= v_thrThread2of3ForFork0_thidvar1_2 0) (= |v_thrThread2of3ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre8#1_35| v_thrThread2of3ForFork0_thidvar0_2) (= |v_thrThread2of3ForFork0_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_35|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_12|, thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_4|, thrThread2of3ForFork0_thidvar1=v_thrThread2of3ForFork0_thidvar1_2, thrThread2of3ForFork0_thidvar0=v_thrThread2of3ForFork0_thidvar0_2, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_14|, thrThread2of3ForFork0_~arg#1.offset=|v_thrThread2of3ForFork0_~arg#1.offset_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_35|, thrThread2of3ForFork0_#res#1.offset=|v_thrThread2of3ForFork0_#res#1.offset_4|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_4|, thrThread2of3ForFork0_~arg#1.base=|v_thrThread2of3ForFork0_~arg#1.base_4|, thrThread2of3ForFork0_#t~ret4#1=|v_thrThread2of3ForFork0_#t~ret4#1_6|, thrThread2of3ForFork0_#res#1.base=|v_thrThread2of3ForFork0_#res#1.base_4|, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_20|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread2of3ForFork0_#t~ret5#1=|v_thrThread2of3ForFork0_#t~ret5#1_6|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_#in~arg#1.base, thrThread2of3ForFork0_thidvar1, thrThread2of3ForFork0_thidvar0, thrThread2of3ForFork0_~end~0#1, thrThread2of3ForFork0_~arg#1.offset, thrThread2of3ForFork0_#res#1.offset, thrThread2of3ForFork0_#in~arg#1.offset, thrThread2of3ForFork0_~arg#1.base, thrThread2of3ForFork0_#t~ret4#1, thrThread2of3ForFork0_#res#1.base, thrThread2of3ForFork0_~c~0#1, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_#t~ret5#1]" "[695] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread2of3ForFork0_~arg#1.offset_1| |v_thrThread2of3ForFork0_#in~arg#1.offset_1|) (= |v_thrThread2of3ForFork0_~arg#1.base_1| |v_thrThread2of3ForFork0_#in~arg#1.base_1|)) InVars {thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_1|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread2of3ForFork0_~arg#1.offset=|v_thrThread2of3ForFork0_~arg#1.offset_1|, thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_1|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_1|, thrThread2of3ForFork0_~arg#1.base=|v_thrThread2of3ForFork0_~arg#1.base_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~arg#1.offset, thrThread2of3ForFork0_~arg#1.base]" "[696] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1]" "[697] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~end~0#1]" "[698] L1038-->L1039: Formula: (= |v_thrThread2of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1]" "[699] L1039-->L1040: Formula: (= |v_thrThread2of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~end~0#1]" "[612] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[614] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[700] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|))) (and (= (select .cse0 |v_~#lock~0.offset_15|) 0) (= |v_thrThread2of3ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store .cse0 |v_~#lock~0.offset_15| 1))))) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread2of3ForFork0_#t~ret4#1=|v_thrThread2of3ForFork0_#t~ret4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret4#1]" "[701] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread2of3ForFork0_#t~ret4#1=|v_thrThread2of3ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_#t~ret4#1]" "[702] L1041-->L1042: Formula: (<= (+ v_~next~0_3 10) v_~len~0_5) InVars {~next~0=v_~next~0_3, ~len~0=v_~len~0_5} OutVars{~next~0=v_~next~0_3, ~len~0=v_~len~0_5} AuxVars[] AssignedVars[]" "[704] L1042-->L1043: Formula: (= v_~next~0_4 |v_thrThread2of3ForFork0_~c~0#1_5|) InVars {~next~0=v_~next~0_4} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_5|, ~next~0=v_~next~0_4} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1]" "[706] L1043-->L1043-1: Formula: (= (+ v_~next~0_5 10) |v_thrThread2of3ForFork0_~end~0#1_5|) InVars {~next~0=v_~next~0_5} OutVars{~next~0=v_~next~0_5, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_5|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~end~0#1]" "[708] L1043-1-->L1041-2: Formula: (= v_~next~0_6 |v_thrThread2of3ForFork0_~end~0#1_7|) InVars {thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_7|} OutVars{~next~0=v_~next~0_6, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_7|} AuxVars[] AssignedVars[~next~0]" "[705] L1041-2-->L1045-2: Formula: (and (= |v_thrThread2of3ForFork0_#t~ret5#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0)))) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~ret5#1=|v_thrThread2of3ForFork0_#t~ret5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret5#1]" "[707] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread2of3ForFork0_#t~ret5#1=|v_thrThread2of3ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_#t~ret5#1]" [2025-04-26 18:18:07,185 INFO L754 eck$LassoCheckResult]: Loop: "[710] L1046-1-->L1047: Formula: (< |v_thrThread2of3ForFork0_~c~0#1_9| |v_thrThread2of3ForFork0_~end~0#1_11|) InVars {thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_9|, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_11|} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_9|, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_11|} AuxVars[] AssignedVars[]" "[712] L1047-->L1047-1: Formula: (= (ite (and (<= 0 |v_thrThread2of3ForFork0_~c~0#1_11|) (< |v_thrThread2of3ForFork0_~c~0#1_11| v_~len~0_7)) 1 0) |v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_11|, ~len~0=v_~len~0_7} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_11|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_1|, ~len~0=v_~len~0_7} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1]" "[714] L1047-1-->L1023: Formula: true InVars {} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1]" "[715] L1023-->L1024: Formula: (= |v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_3| |v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_3|) InVars {thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_3|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1]" "[717] L1024-->L1024-2: Formula: (not (= |v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[720] L1024-2-->L1047-2: Formula: true InVars {} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1]" "[722] L1047-2-->L1048: Formula: true InVars {} OutVars{thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1]" "[723] L1048-->L1048-1: Formula: (let ((.cse1 (* |v_thrThread2of3ForFork0_~c~0#1_13| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= 0 .cse0) (= (select |v_#valid_7| v_~data~0.base_3) 1) (<= (+ v_~data~0.offset_3 .cse1 4) (select |v_#length_6| v_~data~0.base_3))))) InVars {#memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_13|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} OutVars{#memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_13|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#memory_int]" "[724] L1048-1-->L1046-1: Formula: (= |v_thrThread2of3ForFork0_~c~0#1_16| (+ |v_thrThread2of3ForFork0_~c~0#1_15| 1)) InVars {thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_15|} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_16|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1]" [2025-04-26 18:18:07,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1956470296, now seen corresponding path program 1 times [2025-04-26 18:18:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:07,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725713920] [2025-04-26 18:18:07,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:07,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-26 18:18:07,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-26 18:18:07,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:07,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:07,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:07,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-26 18:18:07,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-26 18:18:07,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:07,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:07,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:07,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:07,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1956744788, now seen corresponding path program 2 times [2025-04-26 18:18:07,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:07,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940772662] [2025-04-26 18:18:07,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:18:07,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:07,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:07,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:07,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:18:07,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:07,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:07,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:07,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:07,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:07,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:07,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:07,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:07,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1285948325, now seen corresponding path program 1 times [2025-04-26 18:18:07,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:07,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595083338] [2025-04-26 18:18:07,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:07,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-26 18:18:07,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-26 18:18:07,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:07,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:07,226 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:07,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-26 18:18:07,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-26 18:18:07,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:07,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:07,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:07,705 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:18:07,705 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:18:07,705 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:18:07,705 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:18:07,705 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:18:07,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:07,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:18:07,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:18:07,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: sssc12.i_petrified3_Iteration5_Lasso [2025-04-26 18:18:07,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:18:07,705 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:18:07,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:07,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:08,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:08,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:08,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:18:08,445 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:18:08,445 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:18:08,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,447 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-04-26 18:18:08,452 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 [2025-04-26 18:18:08,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:08,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:08,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:08,463 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:08,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,471 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-04-26 18:18:08,472 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 [2025-04-26 18:18:08,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,484 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-04-26 18:18:08,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,492 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-04-26 18:18:08,493 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 [2025-04-26 18:18:08,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:08,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:08,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:08,504 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-04-26 18:18:08,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,510 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-04-26 18:18:08,512 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 [2025-04-26 18:18:08,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,524 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-04-26 18:18:08,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,533 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-04-26 18:18:08,535 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 [2025-04-26 18:18:08,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,547 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:08,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,554 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-04-26 18:18:08,555 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 [2025-04-26 18:18:08,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:08,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:08,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:08,566 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-04-26 18:18:08,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,572 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-04-26 18:18:08,574 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 [2025-04-26 18:18:08,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,586 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-04-26 18:18:08,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,592 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-04-26 18:18:08,594 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 [2025-04-26 18:18:08,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,606 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-04-26 18:18:08,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,612 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-04-26 18:18:08,614 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 [2025-04-26 18:18:08,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,626 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:08,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,632 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-04-26 18:18:08,634 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 [2025-04-26 18:18:08,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,646 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-04-26 18:18:08,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,652 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-04-26 18:18:08,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 [2025-04-26 18:18:08,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,665 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2025-04-26 18:18:08,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,672 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-04-26 18:18:08,673 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 [2025-04-26 18:18:08,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,685 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-04-26 18:18:08,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,691 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-04-26 18:18:08,692 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 [2025-04-26 18:18:08,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,704 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:08,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,711 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-04-26 18:18:08,712 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 [2025-04-26 18:18:08,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,724 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-04-26 18:18:08,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,731 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-04-26 18:18:08,732 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 [2025-04-26 18:18:08,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,744 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2025-04-26 18:18:08,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,751 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-04-26 18:18:08,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:08,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,764 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-04-26 18:18:08,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,771 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-04-26 18:18:08,772 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 [2025-04-26 18:18:08,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:08,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:08,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:08,782 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-04-26 18:18:08,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,788 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-04-26 18:18:08,789 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 [2025-04-26 18:18:08,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:08,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:08,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:08,800 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:08,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,806 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-04-26 18:18:08,808 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 [2025-04-26 18:18:08,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:08,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:08,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:08,818 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:08,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,824 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-04-26 18:18:08,826 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 [2025-04-26 18:18:08,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,837 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-04-26 18:18:08,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,844 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-04-26 18:18:08,845 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 [2025-04-26 18:18:08,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,857 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-04-26 18:18:08,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,864 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-04-26 18:18:08,865 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 [2025-04-26 18:18:08,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,877 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-04-26 18:18:08,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,884 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-04-26 18:18:08,885 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 [2025-04-26 18:18:08,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:08,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:08,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:08,895 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-04-26 18:18:08,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,902 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-04-26 18:18:08,904 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 [2025-04-26 18:18:08,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,916 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2025-04-26 18:18:08,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,922 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-04-26 18:18:08,924 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 [2025-04-26 18:18:08,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,936 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-04-26 18:18:08,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,942 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-04-26 18:18:08,944 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 [2025-04-26 18:18:08,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,956 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-04-26 18:18:08,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,963 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-04-26 18:18:08,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:08,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,977 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:08,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-04-26 18:18:08,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:08,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:08,983 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:08,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-04-26 18:18:08,984 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 [2025-04-26 18:18:08,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:08,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:08,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:08,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:08,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:08,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:08,996 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-04-26 18:18:09,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,003 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-04-26 18:18:09,005 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 [2025-04-26 18:18:09,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,017 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:09,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,023 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-04-26 18:18:09,025 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 [2025-04-26 18:18:09,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,037 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:09,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,044 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-04-26 18:18:09,045 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 [2025-04-26 18:18:09,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,057 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2025-04-26 18:18:09,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,064 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-04-26 18:18:09,066 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 [2025-04-26 18:18:09,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,078 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-04-26 18:18:09,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,085 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-04-26 18:18:09,086 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 [2025-04-26 18:18:09,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,099 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-04-26 18:18:09,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,106 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-04-26 18:18:09,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:09,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,118 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-04-26 18:18:09,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,125 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-04-26 18:18:09,126 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 [2025-04-26 18:18:09,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,139 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-04-26 18:18:09,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,146 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-04-26 18:18:09,147 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 [2025-04-26 18:18:09,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,160 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2025-04-26 18:18:09,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,166 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-04-26 18:18:09,168 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 [2025-04-26 18:18:09,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,180 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-04-26 18:18:09,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,187 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-04-26 18:18:09,188 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 [2025-04-26 18:18:09,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,200 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-04-26 18:18:09,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,207 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-04-26 18:18:09,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 [2025-04-26 18:18:09,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,220 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-04-26 18:18:09,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,227 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-04-26 18:18:09,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 [2025-04-26 18:18:09,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,240 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2025-04-26 18:18:09,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,247 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-04-26 18:18:09,248 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 [2025-04-26 18:18:09,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,260 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2025-04-26 18:18:09,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,267 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-04-26 18:18:09,268 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 [2025-04-26 18:18:09,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,280 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2025-04-26 18:18:09,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,286 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-04-26 18:18:09,287 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 [2025-04-26 18:18:09,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,300 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-04-26 18:18:09,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,306 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-04-26 18:18:09,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:09,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,319 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:09,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,325 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-04-26 18:18:09,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 [2025-04-26 18:18:09,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,339 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-04-26 18:18:09,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,346 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-04-26 18:18:09,347 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 [2025-04-26 18:18:09,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,359 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-04-26 18:18:09,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,366 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-04-26 18:18:09,367 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 [2025-04-26 18:18:09,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,380 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2025-04-26 18:18:09,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,387 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-04-26 18:18:09,389 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 [2025-04-26 18:18:09,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,399 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2025-04-26 18:18:09,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,406 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2025-04-26 18:18:09,407 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 [2025-04-26 18:18:09,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,418 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2025-04-26 18:18:09,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,424 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-04-26 18:18:09,425 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 [2025-04-26 18:18:09,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,437 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-04-26 18:18:09,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,444 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-04-26 18:18:09,445 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 [2025-04-26 18:18:09,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,456 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2025-04-26 18:18:09,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,462 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-04-26 18:18:09,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:09,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,474 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2025-04-26 18:18:09,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,480 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-04-26 18:18:09,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:09,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,494 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:09,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,501 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-04-26 18:18:09,502 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 [2025-04-26 18:18:09,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,513 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2025-04-26 18:18:09,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,519 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-04-26 18:18:09,520 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 [2025-04-26 18:18:09,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,531 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:09,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,538 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-04-26 18:18:09,539 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 [2025-04-26 18:18:09,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,552 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:09,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,558 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-04-26 18:18:09,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:09,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,572 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2025-04-26 18:18:09,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,578 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-04-26 18:18:09,579 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 [2025-04-26 18:18:09,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,592 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2025-04-26 18:18:09,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,598 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-04-26 18:18:09,600 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 [2025-04-26 18:18:09,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,615 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2025-04-26 18:18:09,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,621 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-04-26 18:18:09,623 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 [2025-04-26 18:18:09,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,635 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2025-04-26 18:18:09,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,641 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-04-26 18:18:09,643 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 [2025-04-26 18:18:09,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,655 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2025-04-26 18:18:09,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,661 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-04-26 18:18:09,663 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 [2025-04-26 18:18:09,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,675 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-04-26 18:18:09,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,682 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-04-26 18:18:09,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:18:09,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,693 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-04-26 18:18:09,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,700 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-04-26 18:18:09,702 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 [2025-04-26 18:18:09,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,714 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2025-04-26 18:18:09,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,721 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-04-26 18:18:09,722 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 [2025-04-26 18:18:09,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,734 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:09,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,741 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2025-04-26 18:18:09,743 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 [2025-04-26 18:18:09,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,753 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:09,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,761 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2025-04-26 18:18:09,762 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 [2025-04-26 18:18:09,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,776 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2025-04-26 18:18:09,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,782 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2025-04-26 18:18:09,785 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 [2025-04-26 18:18:09,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,797 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2025-04-26 18:18:09,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,804 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2025-04-26 18:18:09,805 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 [2025-04-26 18:18:09,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:18:09,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:18:09,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:18:09,816 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2025-04-26 18:18:09,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,822 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2025-04-26 18:18:09,824 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 [2025-04-26 18:18:09,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,836 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2025-04-26 18:18:09,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,843 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2025-04-26 18:18:09,844 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 [2025-04-26 18:18:09,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,857 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2025-04-26 18:18:09,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,864 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2025-04-26 18:18:09,865 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 [2025-04-26 18:18:09,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,878 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2025-04-26 18:18:09,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,884 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2025-04-26 18:18:09,886 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 [2025-04-26 18:18:09,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,898 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2025-04-26 18:18:09,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,905 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2025-04-26 18:18:09,906 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 [2025-04-26 18:18:09,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,918 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2025-04-26 18:18:09,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,925 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2025-04-26 18:18:09,926 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 [2025-04-26 18:18:09,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,939 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2025-04-26 18:18:09,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,945 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2025-04-26 18:18:09,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 [2025-04-26 18:18:09,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,956 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:18:09,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,957 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:18:09,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,960 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:18:09,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2025-04-26 18:18:09,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:09,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:09,967 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:09,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2025-04-26 18:18:09,968 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 [2025-04-26 18:18:09,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:18:09,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:18:09,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:18:09,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:18:09,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:18:09,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:18:09,987 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:18:10,006 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 18:18:10,006 INFO L437 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-04-26 18:18:10,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:18:10,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:10,008 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:10,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2025-04-26 18:18:10,010 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:18:10,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:10,026 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:18:10,027 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:18:10,027 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thrThread2of3ForFork0_~c~0#1, thrThread2of3ForFork0_~end~0#1) = -1*thrThread2of3ForFork0_~c~0#1 + 1*thrThread2of3ForFork0_~end~0#1 Supporting invariants [] [2025-04-26 18:18:10,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2025-04-26 18:18:10,044 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-04-26 18:18:10,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:10,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-26 18:18:10,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-26 18:18:10,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:10,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:18:10,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:18:10,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:18:10,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:18:10,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:18:10,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:10,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:18:10,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:18:10,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:18:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:18:10,151 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 [2025-04-26 18:18:10,151 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13790 states and 20537 transitions. cyclomatic complexity: 7554 Second operand has 3 states, 3 states have (on average 22.0) internal successors, (in total 66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:10,302 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13790 states and 20537 transitions. cyclomatic complexity: 7554. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (in total 66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 24818 states and 38542 transitions. Complement of second has 6 states. [2025-04-26 18:18:10,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:18:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (in total 66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2025-04-26 18:18:10,303 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 274 transitions. Stem has 65 letters. Loop has 9 letters. [2025-04-26 18:18:10,303 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:18:10,303 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 274 transitions. Stem has 74 letters. Loop has 9 letters. [2025-04-26 18:18:10,303 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:18:10,303 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 274 transitions. Stem has 65 letters. Loop has 18 letters. [2025-04-26 18:18:10,303 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:18:10,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24818 states and 38542 transitions. [2025-04-26 18:18:10,435 INFO L131 ngComponentsAnalysis]: Automaton has 648 accepting balls. 1648 [2025-04-26 18:18:10,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24818 states to 19441 states and 30076 transitions. [2025-04-26 18:18:10,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10286 [2025-04-26 18:18:10,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10969 [2025-04-26 18:18:10,527 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19441 states and 30076 transitions. [2025-04-26 18:18:10,527 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:18:10,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19441 states and 30076 transitions. [2025-04-26 18:18:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19441 states and 30076 transitions. [2025-04-26 18:18:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19441 to 18537. [2025-04-26 18:18:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18537 states, 18537 states have (on average 1.5337433241624858) internal successors, (in total 28431), 18536 states have internal predecessors, (28431), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:18:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18537 states to 18537 states and 28431 transitions. [2025-04-26 18:18:10,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18537 states and 28431 transitions. [2025-04-26 18:18:10,797 INFO L438 stractBuchiCegarLoop]: Abstraction has 18537 states and 28431 transitions. [2025-04-26 18:18:10,797 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:18:10,797 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18537 states and 28431 transitions. [2025-04-26 18:18:10,862 INFO L131 ngComponentsAnalysis]: Automaton has 647 accepting balls. 1647 [2025-04-26 18:18:10,862 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:18:10,862 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:18:10,863 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:18:10,863 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:18:10,864 INFO L752 eck$LassoCheckResult]: Stem: "[587] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[599] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[613] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[632] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[606] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[589] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[567] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[569] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[619] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[594] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[570] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[574] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[607] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[618] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[605] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[560] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[582] L1035-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[621] L-1-1-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base, ULTIMATE.start_main_~t~0#1]" "[591] L1054-->L1055: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[595] L1055-->L1056: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[628] L1056-->L1056-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[610] L1056-1-->L1056-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet6#1_3|) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~len~0]" "[623] L1056-2-->L1057: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1]" "[593] L1057-->L1057-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[572] L1057-1-->L1020: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[580] L1020-->L1021: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[579] L1021-->L1020-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[631] L1020-1-->L1057-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[604] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[586] L1058-->L1058-1: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2|) 0) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| (* (mod v_~len~0_4 1073741824) 4))) (< |v_ULTIMATE.start_main_#t~malloc7#1.base_2| |v_#StackHeapBarrier_2|) (not (= |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 0)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc7#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_2|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_2|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[565] L1058-1-->L1058-2: Formula: (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_3| v_~data~0.base_2) (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7#1.offset_3|)) InVars {ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ~data~0.base=v_~data~0.base_2, ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_3|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_3|} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[626] L1058-2-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc7#1.offset=|v_ULTIMATE.start_main_#t~malloc7#1.offset_4|, ULTIMATE.start_main_#t~malloc7#1.base=|v_ULTIMATE.start_main_#t~malloc7#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7#1.offset, ULTIMATE.start_main_#t~malloc7#1.base]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[727] L1060-2-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_33| v_thrThread1of3ForFork0_thidvar0_2) (= v_thrThread1of3ForFork0_thidvar1_2 0) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_33|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_20|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_6|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_6|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_#t~ret5#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_#t~ret4#1, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1]" "[635] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of3ForFork0_~arg#1.base_1| |v_thrThread1of3ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_1| |v_thrThread1of3ForFork0_~arg#1.offset_1|)) InVars {thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_1|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset]" "[636] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[637] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[638] L1038-->L1039: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[639] L1039-->L1040: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[612] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[614] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[728] L1060-2-->$Ultimate##0: Formula: (and (= v_thrThread2of3ForFork0_thidvar1_2 0) (= |v_thrThread2of3ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre8#1_35| v_thrThread2of3ForFork0_thidvar0_2) (= |v_thrThread2of3ForFork0_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_35|} OutVars{thrThread2of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_~cond#1_12|, thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_4|, thrThread2of3ForFork0_thidvar1=v_thrThread2of3ForFork0_thidvar1_2, thrThread2of3ForFork0_thidvar0=v_thrThread2of3ForFork0_thidvar0_2, thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_14|, thrThread2of3ForFork0_~arg#1.offset=|v_thrThread2of3ForFork0_~arg#1.offset_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_35|, thrThread2of3ForFork0_#res#1.offset=|v_thrThread2of3ForFork0_#res#1.offset_4|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_4|, thrThread2of3ForFork0_~arg#1.base=|v_thrThread2of3ForFork0_~arg#1.base_4|, thrThread2of3ForFork0_#t~ret4#1=|v_thrThread2of3ForFork0_#t~ret4#1_6|, thrThread2of3ForFork0_#res#1.base=|v_thrThread2of3ForFork0_#res#1.base_4|, thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_20|, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread2of3ForFork0_#t~ret5#1=|v_thrThread2of3ForFork0_#t~ret5#1_6|} AuxVars[] AssignedVars[thrThread2of3ForFork0___VERIFIER_assert_~cond#1, thrThread2of3ForFork0_#in~arg#1.base, thrThread2of3ForFork0_thidvar1, thrThread2of3ForFork0_thidvar0, thrThread2of3ForFork0_~end~0#1, thrThread2of3ForFork0_~arg#1.offset, thrThread2of3ForFork0_#res#1.offset, thrThread2of3ForFork0_#in~arg#1.offset, thrThread2of3ForFork0_~arg#1.base, thrThread2of3ForFork0_#t~ret4#1, thrThread2of3ForFork0_#res#1.base, thrThread2of3ForFork0_~c~0#1, thrThread2of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of3ForFork0_#t~ret5#1]" "[695] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread2of3ForFork0_~arg#1.offset_1| |v_thrThread2of3ForFork0_#in~arg#1.offset_1|) (= |v_thrThread2of3ForFork0_~arg#1.base_1| |v_thrThread2of3ForFork0_#in~arg#1.base_1|)) InVars {thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_1|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread2of3ForFork0_~arg#1.offset=|v_thrThread2of3ForFork0_~arg#1.offset_1|, thrThread2of3ForFork0_#in~arg#1.base=|v_thrThread2of3ForFork0_#in~arg#1.base_1|, thrThread2of3ForFork0_#in~arg#1.offset=|v_thrThread2of3ForFork0_#in~arg#1.offset_1|, thrThread2of3ForFork0_~arg#1.base=|v_thrThread2of3ForFork0_~arg#1.base_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~arg#1.offset, thrThread2of3ForFork0_~arg#1.base]" "[696] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1]" "[697] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~end~0#1]" "[698] L1038-->L1039: Formula: (= |v_thrThread2of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread2of3ForFork0_~c~0#1=|v_thrThread2of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~c~0#1]" "[699] L1039-->L1040: Formula: (= |v_thrThread2of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread2of3ForFork0_~end~0#1=|v_thrThread2of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread2of3ForFork0_~end~0#1]" "[612] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[614] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[729] L1060-2-->$Ultimate##0: Formula: (and (= |v_thrThread3of3ForFork0_#in~arg#1.offset_4| 0) (= v_thrThread3of3ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre8#1_37| v_thrThread3of3ForFork0_thidvar0_2) (= |v_thrThread3of3ForFork0_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_37|} OutVars{thrThread3of3ForFork0_#res#1.base=|v_thrThread3of3ForFork0_#res#1.base_4|, thrThread3of3ForFork0_#in~arg#1.offset=|v_thrThread3of3ForFork0_#in~arg#1.offset_4|, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1_8|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_37|, thrThread3of3ForFork0_thidvar0=v_thrThread3of3ForFork0_thidvar0_2, thrThread3of3ForFork0_#t~ret5#1=|v_thrThread3of3ForFork0_#t~ret5#1_6|, thrThread3of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread3of3ForFork0___VERIFIER_assert_~cond#1_12|, thrThread3of3ForFork0_~arg#1.base=|v_thrThread3of3ForFork0_~arg#1.base_4|, thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_20|, thrThread3of3ForFork0_#in~arg#1.base=|v_thrThread3of3ForFork0_#in~arg#1.base_4|, thrThread3of3ForFork0_thidvar1=v_thrThread3of3ForFork0_thidvar1_2, thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_14|, thrThread3of3ForFork0_#res#1.offset=|v_thrThread3of3ForFork0_#res#1.offset_4|, thrThread3of3ForFork0_~arg#1.offset=|v_thrThread3of3ForFork0_~arg#1.offset_4|, thrThread3of3ForFork0_#t~ret4#1=|v_thrThread3of3ForFork0_#t~ret4#1_6|} AuxVars[] AssignedVars[thrThread3of3ForFork0_#res#1.base, thrThread3of3ForFork0_#in~arg#1.offset, thrThread3of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread3of3ForFork0_thidvar0, thrThread3of3ForFork0_#t~ret5#1, thrThread3of3ForFork0___VERIFIER_assert_~cond#1, thrThread3of3ForFork0_~arg#1.base, thrThread3of3ForFork0_~c~0#1, thrThread3of3ForFork0_#in~arg#1.base, thrThread3of3ForFork0_thidvar1, thrThread3of3ForFork0_~end~0#1, thrThread3of3ForFork0_#res#1.offset, thrThread3of3ForFork0_~arg#1.offset, thrThread3of3ForFork0_#t~ret4#1]" "[665] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread3of3ForFork0_#in~arg#1.base_1| |v_thrThread3of3ForFork0_~arg#1.base_1|) (= |v_thrThread3of3ForFork0_~arg#1.offset_1| |v_thrThread3of3ForFork0_#in~arg#1.offset_1|)) InVars {thrThread3of3ForFork0_#in~arg#1.base=|v_thrThread3of3ForFork0_#in~arg#1.base_1|, thrThread3of3ForFork0_#in~arg#1.offset=|v_thrThread3of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread3of3ForFork0_~arg#1.base=|v_thrThread3of3ForFork0_~arg#1.base_1|, thrThread3of3ForFork0_#in~arg#1.offset=|v_thrThread3of3ForFork0_#in~arg#1.offset_1|, thrThread3of3ForFork0_#in~arg#1.base=|v_thrThread3of3ForFork0_#in~arg#1.base_1|, thrThread3of3ForFork0_~arg#1.offset=|v_thrThread3of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread3of3ForFork0_~arg#1.base, thrThread3of3ForFork0_~arg#1.offset]" "[666] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread3of3ForFork0_~c~0#1]" "[667] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread3of3ForFork0_~end~0#1]" "[668] L1038-->L1039: Formula: (= |v_thrThread3of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread3of3ForFork0_~c~0#1=|v_thrThread3of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread3of3ForFork0_~c~0#1]" "[669] L1039-->L1040: Formula: (= |v_thrThread3of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread3of3ForFork0_~end~0#1=|v_thrThread3of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread3of3ForFork0_~end~0#1]" "[612] L1060-3-->L1060-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[614] L1060-4-->L1059-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[562] L1059-1-->L1060: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1]" "[573] L1060-->L1060-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[611] L1060-1-->L1060-2: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[725] L1060-2-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:18:10,864 INFO L754 eck$LassoCheckResult]: Loop: "[726] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:18:10,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:10,864 INFO L85 PathProgramCache]: Analyzing trace with hash -43691070, now seen corresponding path program 1 times [2025-04-26 18:18:10,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:10,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404746614] [2025-04-26 18:18:10,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:10,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:10,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-26 18:18:10,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-26 18:18:10,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:10,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:10,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:10,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-26 18:18:10,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-26 18:18:10,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:10,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:10,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:10,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash 757, now seen corresponding path program 1 times [2025-04-26 18:18:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:10,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967578588] [2025-04-26 18:18:10,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:10,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:10,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:18:10,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:18:10,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:10,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:10,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:10,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:18:10,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:18:10,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:10,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:10,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:10,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:18:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1354422444, now seen corresponding path program 1 times [2025-04-26 18:18:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:18:10,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588750016] [2025-04-26 18:18:10,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:18:10,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:18:10,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 18:18:10,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 18:18:10,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:10,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:10,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:10,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 18:18:10,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 18:18:10,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:10,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:10,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:18:11,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-26 18:18:11,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-26 18:18:11,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:11,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:11,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:18:11,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-26 18:18:11,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-26 18:18:11,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:18:11,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:18:11,595 WARN L166 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:18:11,614 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:18:11,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (84)] Forceful destruction successful, exit code 0 [2025-04-26 18:18:11,622 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:18:11,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:18:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:18:11,624 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:18:11,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (207)] Waiting until timeout for monitored process [2025-04-26 18:18:11,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 170 transitions, 368 flow [2025-04-26 18:18:11,683 INFO L116 PetriNetUnfolderBase]: 14/208 cut-off events. [2025-04-26 18:18:11,683 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-26 18:18:11,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 208 events. 14/208 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 174. Up to 5 conditions per place. [2025-04-26 18:18:11,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 170 transitions, 368 flow [2025-04-26 18:18:11,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 170 transitions, 368 flow [2025-04-26 18:18:11,690 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 165 places, 170 transitions, 368 flow [2025-04-26 18:18:11,690 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 165 places, 170 transitions, 368 flow