/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/reorder_5.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:16:10,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:16:10,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:16:10,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:16:10,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:16:10,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:16:10,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:16:10,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:16:10,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:16:10,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:16:10,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:16:10,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:16:10,566 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:16:10,566 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:16:10,566 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:16:10,566 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:16:10,566 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:16:10,566 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:16:10,566 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:16:10,566 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:16:10,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:16:10,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:16:10,566 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:16:10,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:16:10,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:16:10,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:16:10,567 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:16:10,568 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:16:10,568 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:16:10,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:16:10,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:16:10,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:16:10,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:16:10,807 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:16:10,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/reorder_5.i [2025-04-26 18:16:12,089 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f012b330a/2ab1baaa71da4e7496f6557b821a3491/FLAG8c774582a [2025-04-26 18:16:12,369 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:16:12,370 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/reorder_5.i [2025-04-26 18:16:12,387 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f012b330a/2ab1baaa71da4e7496f6557b821a3491/FLAG8c774582a [2025-04-26 18:16:13,090 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f012b330a/2ab1baaa71da4e7496f6557b821a3491 [2025-04-26 18:16:13,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:16:13,093 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:16:13,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:16:13,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:16:13,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:16:13,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6395c5b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13, skipping insertion in model container [2025-04-26 18:16:13,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:16:13,511 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/reorder_5.i[59755,59768] [2025-04-26 18:16:13,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:16:13,521 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:16:13,585 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/reorder_5.i[59755,59768] [2025-04-26 18:16:13,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:16:13,650 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:16:13,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13 WrapperNode [2025-04-26 18:16:13,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:16:13,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:16:13,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:16:13,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:16:13,656 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:16:13" (1/1) ... [2025-04-26 18:16:13,671 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:16:13" (1/1) ... [2025-04-26 18:16:13,686 INFO L138 Inliner]: procedures = 371, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 109 [2025-04-26 18:16:13,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:16:13,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:16:13,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:16:13,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:16:13,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:16:13,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:16:13,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:16:13,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:16:13,708 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13" (1/1) ... [2025-04-26 18:16:13,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:16:13,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:13,733 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:16:13,737 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:16:13,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-26 18:16:13,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-26 18:16:13,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-26 18:16:13,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-26 18:16:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 18:16:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-04-26 18:16:13,751 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-04-26 18:16:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 18:16:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:16:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-04-26 18:16:13,751 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-04-26 18:16:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:16:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:16:13,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:16:13,752 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:16:13,841 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:16:13,842 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:16:14,028 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:16:14,029 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:16:14,039 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:16:14,039 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 18:16:14,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:16:14 BoogieIcfgContainer [2025-04-26 18:16:14,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:16:14,040 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:16:14,040 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:16:14,046 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:16:14,046 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:16:14,047 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:16:13" (1/3) ... [2025-04-26 18:16:14,047 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b9928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:16:14, skipping insertion in model container [2025-04-26 18:16:14,047 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:16:14,047 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:16:13" (2/3) ... [2025-04-26 18:16:14,048 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b9928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:16:14, skipping insertion in model container [2025-04-26 18:16:14,048 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:16:14,048 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:16:14" (3/3) ... [2025-04-26 18:16:14,049 INFO L376 chiAutomizerObserver]: Analyzing ICFG reorder_5.i [2025-04-26 18:16:14,108 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:16:14,144 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:16:14,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:16:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:14,148 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:16:14,150 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:16:14,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 141 transitions, 302 flow [2025-04-26 18:16:14,307 INFO L116 PetriNetUnfolderBase]: 25/289 cut-off events. [2025-04-26 18:16:14,309 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-26 18:16:14,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 289 events. 25/289 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1092 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 143. Up to 7 conditions per place. [2025-04-26 18:16:14,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 141 transitions, 302 flow [2025-04-26 18:16:14,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 141 transitions, 302 flow [2025-04-26 18:16:14,320 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 132 places, 141 transitions, 302 flow [2025-04-26 18:16:14,321 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132 places, 141 transitions, 302 flow [2025-04-26 18:16:14,420 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3720 states, 3710 states have (on average 2.5962264150943395) internal successors, (in total 9632), 3719 states have internal predecessors, (9632), 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:16:14,428 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 3720 states, 3710 states have (on average 2.5962264150943395) internal successors, (in total 9632), 3719 states have internal predecessors, (9632), 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:16:14,430 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:16:14,494 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1381#[checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:14,550 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5909#[setThreadEXIT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadFINAL]true [2025-04-26 18:16:14,578 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4249#[L1284, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293]true [2025-04-26 18:16:14,593 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3691#[L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:14,629 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1087#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadFINAL]true [2025-04-26 18:16:14,633 WARN L140 AmpleReduction]: Number of pruned transitions: 666 [2025-04-26 18:16:14,633 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 5 [2025-04-26 18:16:14,633 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 18:16:14,633 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:443 [2025-04-26 18:16:14,633 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:433 [2025-04-26 18:16:14,633 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:16:14,633 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:16:14,634 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:16:14,635 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 877 states, 867 states have (on average 1.322952710495963) internal successors, (in total 1147), 876 states have internal predecessors, (1147), 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:16:14,641 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:16:14,642 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:16:14,642 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:16:14,642 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:16:14,642 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:16:14,642 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:16:14,642 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:16:14,642 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:16:14,645 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 877 states, 867 states have (on average 1.322952710495963) internal successors, (in total 1147), 876 states have internal predecessors, (1147), 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:16:14,685 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2025-04-26 18:16:14,689 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:16:14,690 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:16:14,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 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] [2025-04-26 18:16:14,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:16:14,695 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:16:14,696 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 877 states, 867 states have (on average 1.322952710495963) internal successors, (in total 1147), 876 states have internal predecessors, (1147), 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:16:14,706 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2025-04-26 18:16:14,707 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:16:14,707 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:16:14,707 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 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] [2025-04-26 18:16:14,707 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:16:14,712 INFO L752 eck$LassoCheckResult]: Stem: "[213] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[230] L-1-->L11: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[241] L11-->L11-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[]" "[234] L11-1-->L11-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[]" "[280] L11-2-->L11-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[]" "[278] L11-3-->L11-4: Formula: (and (= 12 (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[]" "[196] L11-4-->L11-5: Formula: (and (= (select |v_#valid_4| 3) 1) (= 12 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[310] L11-5-->L1230: Formula: (= v_~iSet~0_1 4) InVars {} OutVars{~iSet~0=v_~iSet~0_1} AuxVars[] AssignedVars[~iSet~0]" "[194] L1230-->L1231: Formula: (= v_~iCheck~0_1 1) InVars {} OutVars{~iCheck~0=v_~iCheck~0_1} AuxVars[] AssignedVars[~iCheck~0]" "[259] L1231-->L1232: Formula: (= v_~a~0_3 0) InVars {} OutVars{~a~0=v_~a~0_3} AuxVars[] AssignedVars[~a~0]" "[192] L1232-->L-1-1: Formula: (= v_~b~0_3 0) InVars {} OutVars{~b~0=v_~b~0_3} AuxVars[] AssignedVars[~b~0]" "[314] L-1-1-->L-1-2: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset]" "[316] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[317] L-1-3-->L1238: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre43#1=|v_ULTIMATE.start_main_#t~pre43#1_1|, ULTIMATE.start_main_#t~post46#1=|v_ULTIMATE.start_main_#t~post46#1_1|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_1|, ULTIMATE.start_main_#t~ret41#1=|v_ULTIMATE.start_main_#t~ret41#1_1|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_1|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_1|, ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_1|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_1|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_1|, ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_1|, ULTIMATE.start_main_#t~post52#1=|v_ULTIMATE.start_main_#t~post52#1_1|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_1|, ULTIMATE.start_main_#t~ret34#1=|v_ULTIMATE.start_main_#t~ret34#1_1|, ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_1|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_1|, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_1|, ULTIMATE.start_main_#t~post49#1=|v_ULTIMATE.start_main_#t~post49#1_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_1|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre43#1, ULTIMATE.start_main_#t~post46#1, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~ret41#1, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~post42#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_main_#t~nondet35#1, ULTIMATE.start_main_~#checkPool~0#1.base, ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~post52#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet40#1, ULTIMATE.start_main_#t~ret34#1, ULTIMATE.start_main_~err~0#1, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#t~nondet37#1, ULTIMATE.start_main_#t~post49#1, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~mem50#1, ULTIMATE.start_main_~#setPool~0#1.offset]" "[275] L1238-->L1239: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1]" "[239] L1239-->L1239-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[265] L1239-1-->L1240: Formula: true InVars {} OutVars{ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~err~0#1]" "[244] L1240-->L1240-1: Formula: (= |v_ULTIMATE.start_main_~argc#1_6| 1) InVars {ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_6|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_6|} AuxVars[] AssignedVars[]" "[211] L1240-1-->L1249-1: Formula: (and (<= v_~iSet~0_4 100000) (<= v_~iCheck~0_4 100000)) InVars {~iSet~0=v_~iSet~0_4, ~iCheck~0=v_~iCheck~0_4} OutVars{~iSet~0=v_~iSet~0_4, ~iCheck~0=v_~iCheck~0_4} AuxVars[] AssignedVars[]" "[296] L1249-1-->L1252: Formula: (and (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| (* 4 (mod v_~iSet~0_5 1073741824))))) InVars {~iSet~0=v_~iSet~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{~iSet~0=v_~iSet~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_2|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#setPool~0#1.base, #valid, #length, ULTIMATE.start_main_~#setPool~0#1.offset]" "[186] L1252-->L1253: Formula: (and (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| (* (mod v_~iCheck~0_5 1073741824) 4))) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, #valid=|v_#valid_8|, ~iCheck~0=v_~iCheck~0_5} OutVars{ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_2|, ~iCheck~0=v_~iCheck~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~#checkPool~0#1.offset, #valid, #length, ULTIMATE.start_main_~#checkPool~0#1.base]" "[250] L1253-->L1254-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[300] L1254-3-->L1255: Formula: (< |v_ULTIMATE.start_main_~i~0#1_4| v_~iSet~0_6) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ~iSet~0=v_~iSet~0_6} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ~iSet~0=v_~iSet~0_6} AuxVars[] AssignedVars[]" "[312] L1255-->L1255-1: Formula: (= |v_#pthreadsForks_1| |v_ULTIMATE.start_main_#t~pre39#1_2|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre39#1]" "[212] L1255-1-->L1255-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[209] L1255-2-->L1255-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_5| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre39#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| .cse1 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|))))) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int]" "[340] L1255-3-->$Ultimate##0: Formula: (and (= |v_setThreadThread1of1ForFork0_#in~param.offset_4| 0) (= 0 |v_setThreadThread1of1ForFork0_#in~param.base_4|) (= v_setThreadThread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre39#1_8|)) InVars {ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_8|} OutVars{setThreadThread1of1ForFork0_#in~param.offset=|v_setThreadThread1of1ForFork0_#in~param.offset_4|, setThreadThread1of1ForFork0_#res.base=|v_setThreadThread1of1ForFork0_#res.base_4|, setThreadThread1of1ForFork0_#res.offset=|v_setThreadThread1of1ForFork0_#res.offset_4|, setThreadThread1of1ForFork0_thidvar0=v_setThreadThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_8|, setThreadThread1of1ForFork0_#in~param.base=|v_setThreadThread1of1ForFork0_#in~param.base_4|, setThreadThread1of1ForFork0_~param.base=v_setThreadThread1of1ForFork0_~param.base_4, setThreadThread1of1ForFork0_~param.offset=v_setThreadThread1of1ForFork0_~param.offset_4} AuxVars[] AssignedVars[setThreadThread1of1ForFork0_#in~param.offset, setThreadThread1of1ForFork0_#res.base, setThreadThread1of1ForFork0_#res.offset, setThreadThread1of1ForFork0_thidvar0, setThreadThread1of1ForFork0_#in~param.base, setThreadThread1of1ForFork0_~param.base, setThreadThread1of1ForFork0_~param.offset]" "[321] $Ultimate##0-->L1282: Formula: (and (= v_setThreadThread1of1ForFork0_~param.base_1 |v_setThreadThread1of1ForFork0_#in~param.base_1|) (= |v_setThreadThread1of1ForFork0_#in~param.offset_1| v_setThreadThread1of1ForFork0_~param.offset_1)) InVars {setThreadThread1of1ForFork0_#in~param.offset=|v_setThreadThread1of1ForFork0_#in~param.offset_1|, setThreadThread1of1ForFork0_#in~param.base=|v_setThreadThread1of1ForFork0_#in~param.base_1|} OutVars{setThreadThread1of1ForFork0_#in~param.offset=|v_setThreadThread1of1ForFork0_#in~param.offset_1|, setThreadThread1of1ForFork0_#in~param.base=|v_setThreadThread1of1ForFork0_#in~param.base_1|, setThreadThread1of1ForFork0_~param.base=v_setThreadThread1of1ForFork0_~param.base_1, setThreadThread1of1ForFork0_~param.offset=v_setThreadThread1of1ForFork0_~param.offset_1} AuxVars[] AssignedVars[setThreadThread1of1ForFork0_~param.base, setThreadThread1of1ForFork0_~param.offset]" "[322] L1282-->L1284: Formula: (= v_~a~0_1 1) InVars {} OutVars{~a~0=v_~a~0_1} AuxVars[] AssignedVars[~a~0]" "[315] L1255-4-->L1255-5: Formula: (= |v_ULTIMATE.start_main_~err~0#1_3| |v_ULTIMATE.start_main_#t~nondet40#1_2|) InVars {ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_2|} OutVars{ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_3|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~err~0#1]" "[198] L1255-5-->L1255-9: Formula: (= |v_ULTIMATE.start_main_~err~0#1_5| 0) InVars {ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_5|} OutVars{ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_5|} AuxVars[] AssignedVars[]" "[289] L1255-9-->L1255-10: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre39#1]" "[294] L1255-10-->L1255-11: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40#1]" "[218] L1255-11-->L1254-1: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| |v_ULTIMATE.start_main_#t~post42#1_2|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post42#1]" "[226] L1254-1-->L1254-2: Formula: (= (+ |v_ULTIMATE.start_main_#t~post42#1_3| 1) |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_3|} OutVars{ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[249] L1254-2-->L1254-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post42#1]" "[300] L1254-3-->L1255: Formula: (< |v_ULTIMATE.start_main_~i~0#1_4| v_~iSet~0_6) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ~iSet~0=v_~iSet~0_6} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ~iSet~0=v_~iSet~0_6} AuxVars[] AssignedVars[]" "[312] L1255-->L1255-1: Formula: (= |v_#pthreadsForks_1| |v_ULTIMATE.start_main_#t~pre39#1_2|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre39#1]" "[212] L1255-1-->L1255-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[209] L1255-2-->L1255-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_5| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre39#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| .cse1 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|))))) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int]" "[338] L1255-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[323] L1284-->L1287: Formula: (= (+ v_~b~0_1 1) 0) InVars {} OutVars{~b~0=v_~b~0_1} AuxVars[] AssignedVars[~b~0]" "[324] L1287-->setThreadFINAL: Formula: (and (= |v_setThreadThread1of1ForFork0_#res.offset_1| 0) (= |v_setThreadThread1of1ForFork0_#res.base_1| 0)) InVars {} OutVars{setThreadThread1of1ForFork0_#res.offset=|v_setThreadThread1of1ForFork0_#res.offset_1|, setThreadThread1of1ForFork0_#res.base=|v_setThreadThread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[setThreadThread1of1ForFork0_#res.base, setThreadThread1of1ForFork0_#res.offset]" [2025-04-26 18:16:14,713 INFO L754 eck$LassoCheckResult]: Loop: "[339] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:16:14,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:16:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1240001730, now seen corresponding path program 1 times [2025-04-26 18:16:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:16:14,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888099647] [2025-04-26 18:16:14,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:16:14,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:16:14,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:16:14,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:16:14,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:14,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:14,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:16:14,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:16:14,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:16:14,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:14,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:14,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:16:14,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:16:14,899 INFO L85 PathProgramCache]: Analyzing trace with hash 370, now seen corresponding path program 1 times [2025-04-26 18:16:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:16:14,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680055875] [2025-04-26 18:16:14,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:16:14,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:16:14,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:16:14,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:16:14,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:14,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:14,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:16:14,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:16:14,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:16:14,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:14,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:14,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:16:14,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:16:14,919 INFO L85 PathProgramCache]: Analyzing trace with hash -214651695, now seen corresponding path program 1 times [2025-04-26 18:16:14,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:16:14,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181466908] [2025-04-26 18:16:14,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:16:14,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:16:14,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-26 18:16:14,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-26 18:16:14,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:14,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:14,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:16:14,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-26 18:16:14,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-26 18:16:14,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:14,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:15,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:16:15,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:16:15,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:16:15,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:15,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:15,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:16:15,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 18:16:15,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 18:16:15,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:15,886 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:16:15,899 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-26 18:16:15,908 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:16:15,908 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:16:15,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:16:15,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:15,910 INFO L229 MonitoredProcess]: Starting monitored process 3 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:16:15,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2025-04-26 18:16:15,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 372 flow [2025-04-26 18:16:16,030 INFO L116 PetriNetUnfolderBase]: 108/962 cut-off events. [2025-04-26 18:16:16,030 INFO L117 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-04-26 18:16:16,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 962 events. 108/962 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5540 event pairs, 2 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 551. Up to 32 conditions per place. [2025-04-26 18:16:16,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 164 transitions, 372 flow [2025-04-26 18:16:16,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 164 transitions, 372 flow [2025-04-26 18:16:16,052 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 154 places, 164 transitions, 372 flow [2025-04-26 18:16:16,052 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 164 transitions, 372 flow [2025-04-26 18:16:24,039 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 330744 states, 330700 states have (on average 4.266023586332023) internal successors, (in total 1410774), 330743 states have internal predecessors, (1410774), 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:16:24,563 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 330744 states, 330700 states have (on average 4.266023586332023) internal successors, (in total 1410774), 330743 states have internal predecessors, (1410774), 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:16:24,563 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:16:24,611 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 27137#[checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:24,637 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 23917#[checkThreadFINAL, checkThreadEXIT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:24,650 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 27417#[checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:24,653 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 23995#[checkThreadEXIT, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:24,654 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 21001#[checkThreadFINAL, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:24,997 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 180075#[checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, setThreadEXIT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadFINAL]true [2025-04-26 18:16:25,022 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 161841#[checkThreadEXIT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT, checkThreadFINAL]true [2025-04-26 18:16:25,048 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 180643#[checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:16:25,053 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 161963#[checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT, checkThreadEXIT]true [2025-04-26 18:16:25,054 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 144865#[checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT, checkThreadFINAL]true [2025-04-26 18:16:25,169 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 97619#[L1284, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,183 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 88299#[checkThreadEXIT, L1284, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293]true [2025-04-26 18:16:25,197 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 79967#[L1284, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293]true [2025-04-26 18:16:25,226 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 98071#[L1284, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:16:25,227 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 88507#[L1284, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadEXIT]true [2025-04-26 18:16:25,228 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 80119#[L1284, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadFINAL]true [2025-04-26 18:16:25,228 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 59705#[L1284, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293]true [2025-04-26 18:16:25,263 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 80981#[L1282, L1291, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,266 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 73653#[L1282, checkThreadEXIT, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,270 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 66851#[L1282, L1291, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,278 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 49197#[L1282, L1291, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,281 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 81473#[L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, L1291]true [2025-04-26 18:16:25,282 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 73903#[L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadEXIT, L1291]true [2025-04-26 18:16:25,288 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 67051#[L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291, checkThreadFINAL]true [2025-04-26 18:16:25,289 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 49245#[L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, L1291]true [2025-04-26 18:16:25,289 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 43935#[L1282, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,351 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 560907#[setThreadEXIT, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:16:25,361 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 541819#[setThreadEXIT, checkThreadFINAL, checkThreadEXIT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT]true [2025-04-26 18:16:25,369 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 561795#[setThreadEXIT, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT]true [2025-04-26 18:16:25,370 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 541987#[setThreadEXIT, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadEXIT, setThreadEXIT]true [2025-04-26 18:16:25,370 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 520665#[setThreadEXIT, checkThreadFINAL, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT]true [2025-04-26 18:16:25,398 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 430905#[L1284, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:16:25,403 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 407595#[L1284, checkThreadEXIT, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT]true [2025-04-26 18:16:25,409 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 384149#[L1284, checkThreadFINAL, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT]true [2025-04-26 18:16:25,421 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 431609#[L1284, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, setThreadEXIT]true [2025-04-26 18:16:25,422 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 407913#[L1284, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, setThreadEXIT, checkThreadEXIT]true [2025-04-26 18:16:25,423 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 384363#[checkThreadFINAL, L1284, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, setThreadEXIT]true [2025-04-26 18:16:25,423 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 314743#[L1284, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, setThreadEXIT]true [2025-04-26 18:16:25,452 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 384653#[L1291, L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:16:25,455 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 361581#[L1282, checkThreadEXIT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT, L1291]true [2025-04-26 18:16:25,458 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 338395#[L1282, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT, L1291]true [2025-04-26 18:16:25,465 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 269511#[L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, setThreadEXIT, L1291]true [2025-04-26 18:16:25,468 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 385371#[L1282, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT]true [2025-04-26 18:16:25,468 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 361947#[L1282, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadEXIT, setThreadEXIT]true [2025-04-26 18:16:25,469 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 338663#[L1282, checkThreadFINAL, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT]true [2025-04-26 18:16:25,469 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 269565#[L1282, L1291, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT]true [2025-04-26 18:16:25,469 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 246923#[L1282, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadEXIT, L1291]true [2025-04-26 18:16:25,633 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14753#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadFINAL, setThreadEXIT]true [2025-04-26 18:16:25,648 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 441491#[setThreadEXIT, L1284, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:16:25,658 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 418035#[setThreadEXIT, L1284, checkThreadEXIT, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,666 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 394399#[setThreadEXIT, L1284, checkThreadFINAL, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,677 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 442177#[setThreadEXIT, L1284, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293]true [2025-04-26 18:16:25,678 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 418345#[setThreadEXIT, L1284, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, checkThreadEXIT]true [2025-04-26 18:16:25,678 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 394607#[setThreadEXIT, checkThreadFINAL, L1284, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293]true [2025-04-26 18:16:25,678 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 324475#[setThreadEXIT, L1284, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293]true [2025-04-26 18:16:25,705 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 372515#[L1284, L1284, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:16:25,713 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 349399#[L1284, L1284, checkThreadEXIT, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,721 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 326197#[L1284, L1284, checkThreadFINAL, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,735 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 372969#[L1284, L1284, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293]true [2025-04-26 18:16:25,736 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 349609#[L1284, L1284, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, checkThreadEXIT]true [2025-04-26 18:16:25,736 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 326349#[checkThreadFINAL, L1284, L1284, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293]true [2025-04-26 18:16:25,736 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 257179#[L1284, L1284, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293]true [2025-04-26 18:16:25,775 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 326493#[L1291, L1282, L1284, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:16:25,780 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 303585#[L1282, L1284, checkThreadEXIT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,787 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 280549#[L1282, L1284, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,796 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 213277#[L1282, L1284, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, L1291]true [2025-04-26 18:16:25,800 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 326987#[L1282, L1284, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,801 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 303837#[L1282, L1284, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadEXIT]true [2025-04-26 18:16:25,801 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 280749#[L1282, checkThreadFINAL, L1284, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,801 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 213325#[L1282, L1284, L1291, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,801 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 192311#[L1282, L1284, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,833 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14879#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadFINAL, setThreadEXIT]true [2025-04-26 18:16:25,834 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 13273#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadFINAL, setThreadFINAL]true [2025-04-26 18:16:25,842 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 397693#[L1291, setThreadEXIT, L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:16:25,844 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 374525#[setThreadEXIT, L1282, checkThreadEXIT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,847 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 351245#[setThreadEXIT, L1282, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,852 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 282015#[setThreadEXIT, L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, L1291]true [2025-04-26 18:16:25,855 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 398391#[setThreadEXIT, L1282, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,856 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 374881#[setThreadEXIT, L1282, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadEXIT]true [2025-04-26 18:16:25,857 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 351505#[setThreadEXIT, checkThreadFINAL, L1282, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,857 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 282067#[setThreadEXIT, L1282, L1291, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,857 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 259181#[setThreadEXIT, L1282, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,876 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 329637#[L1291, L1284, L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:16:25,879 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 306729#[L1284, L1282, checkThreadEXIT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,883 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 283693#[L1284, L1282, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,890 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 216313#[L1284, L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, L1291]true [2025-04-26 18:16:25,893 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 330131#[L1284, L1282, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,894 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 306981#[L1284, L1282, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadEXIT]true [2025-04-26 18:16:25,894 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 283893#[checkThreadFINAL, L1282, L1284, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,894 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 216361#[L1284, L1282, L1291, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,894 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 195235#[L1284, L1282, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,922 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 307075#[L1291, L1282, L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION]true [2025-04-26 18:16:25,924 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 284255#[L1282, L1282, checkThreadEXIT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,927 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 261369#[L1282, L1282, checkThreadFINAL, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 195761#[L1282, L1282, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1293, L1291]true [2025-04-26 18:16:25,935 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 307569#[L1282, L1282, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,935 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 284507#[L1282, L1282, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, checkThreadEXIT]true [2025-04-26 18:16:25,935 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 261569#[L1282, L1282, checkThreadFINAL, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,936 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 195809#[L1282, L1282, L1291, L1293, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:16:25,936 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 175865#[L1282, L1282, L1291, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L1291]true [2025-04-26 18:16:25,956 WARN L140 AmpleReduction]: Number of pruned transitions: 34932 [2025-04-26 18:16:25,956 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 100 [2025-04-26 18:16:25,956 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 100 [2025-04-26 18:16:25,956 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:4395 [2025-04-26 18:16:25,957 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:12264 [2025-04-26 18:16:25,957 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:16:25,957 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:16:25,957 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:16:25,998 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 16660 states, 16616 states have (on average 1.5371328839672604) internal successors, (in total 25541), 16659 states have internal predecessors, (25541), 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:16:25,998 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:16:25,998 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:16:25,998 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:16:25,998 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:16:25,998 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:16:25,998 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:16:25,998 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:16:25,998 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:16:26,021 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16660 states, 16616 states have (on average 1.5371328839672604) internal successors, (in total 25541), 16659 states have internal predecessors, (25541), 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:16:26,182 INFO L131 ngComponentsAnalysis]: Automaton has 113 accepting balls. 113 [2025-04-26 18:16:26,182 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:16:26,182 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:16:26,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-04-26 18:16:26,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:16:26,185 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:16:26,205 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16660 states, 16616 states have (on average 1.5371328839672604) internal successors, (in total 25541), 16659 states have internal predecessors, (25541), 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:16:26,337 INFO L131 ngComponentsAnalysis]: Automaton has 113 accepting balls. 113 [2025-04-26 18:16:26,337 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:16:26,337 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:16:26,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-04-26 18:16:26,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:16:26,340 INFO L752 eck$LassoCheckResult]: Stem: "[425] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[442] L-1-->L11: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[453] L11-->L11-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[]" "[446] L11-1-->L11-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[]" "[492] L11-2-->L11-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[]" "[490] L11-3-->L11-4: Formula: (and (= 12 (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[]" "[408] L11-4-->L11-5: Formula: (and (= (select |v_#valid_4| 3) 1) (= 12 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[522] L11-5-->L1230: Formula: (= v_~iSet~0_1 4) InVars {} OutVars{~iSet~0=v_~iSet~0_1} AuxVars[] AssignedVars[~iSet~0]" "[406] L1230-->L1231: Formula: (= v_~iCheck~0_1 1) InVars {} OutVars{~iCheck~0=v_~iCheck~0_1} AuxVars[] AssignedVars[~iCheck~0]" "[471] L1231-->L1232: Formula: (= v_~a~0_3 0) InVars {} OutVars{~a~0=v_~a~0_3} AuxVars[] AssignedVars[~a~0]" "[404] L1232-->L-1-1: Formula: (= v_~b~0_3 0) InVars {} OutVars{~b~0=v_~b~0_3} AuxVars[] AssignedVars[~b~0]" "[526] L-1-1-->L-1-2: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset]" "[528] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[529] L-1-3-->L1238: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre43#1=|v_ULTIMATE.start_main_#t~pre43#1_1|, ULTIMATE.start_main_#t~post46#1=|v_ULTIMATE.start_main_#t~post46#1_1|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_1|, ULTIMATE.start_main_#t~ret41#1=|v_ULTIMATE.start_main_#t~ret41#1_1|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_1|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_1|, ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_1|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_1|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_1|, ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_1|, ULTIMATE.start_main_#t~post52#1=|v_ULTIMATE.start_main_#t~post52#1_1|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_1|, ULTIMATE.start_main_#t~ret34#1=|v_ULTIMATE.start_main_#t~ret34#1_1|, ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_1|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_1|, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_1|, ULTIMATE.start_main_#t~post49#1=|v_ULTIMATE.start_main_#t~post49#1_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_1|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre43#1, ULTIMATE.start_main_#t~post46#1, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~ret41#1, ULTIMATE.start_main_#t~mem47#1, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~post42#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_main_#t~nondet35#1, ULTIMATE.start_main_~#checkPool~0#1.base, ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~post52#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet40#1, ULTIMATE.start_main_#t~ret34#1, ULTIMATE.start_main_~err~0#1, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#t~nondet37#1, ULTIMATE.start_main_#t~post49#1, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~mem50#1, ULTIMATE.start_main_~#setPool~0#1.offset]" "[487] L1238-->L1239: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1]" "[451] L1239-->L1239-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[477] L1239-1-->L1240: Formula: true InVars {} OutVars{ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~err~0#1]" "[456] L1240-->L1240-1: Formula: (= |v_ULTIMATE.start_main_~argc#1_6| 1) InVars {ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_6|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_6|} AuxVars[] AssignedVars[]" "[423] L1240-1-->L1249-1: Formula: (and (<= v_~iSet~0_4 100000) (<= v_~iCheck~0_4 100000)) InVars {~iSet~0=v_~iSet~0_4, ~iCheck~0=v_~iCheck~0_4} OutVars{~iSet~0=v_~iSet~0_4, ~iCheck~0=v_~iCheck~0_4} AuxVars[] AssignedVars[]" "[508] L1249-1-->L1252: Formula: (and (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| (* 4 (mod v_~iSet~0_5 1073741824))))) InVars {~iSet~0=v_~iSet~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{~iSet~0=v_~iSet~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_2|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#setPool~0#1.base, #valid, #length, ULTIMATE.start_main_~#setPool~0#1.offset]" "[398] L1252-->L1253: Formula: (and (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| (* (mod v_~iCheck~0_5 1073741824) 4))) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, #valid=|v_#valid_8|, ~iCheck~0=v_~iCheck~0_5} OutVars{ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_2|, ~iCheck~0=v_~iCheck~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~#checkPool~0#1.offset, #valid, #length, ULTIMATE.start_main_~#checkPool~0#1.base]" "[462] L1253-->L1254-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[512] L1254-3-->L1255: Formula: (< |v_ULTIMATE.start_main_~i~0#1_4| v_~iSet~0_6) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ~iSet~0=v_~iSet~0_6} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ~iSet~0=v_~iSet~0_6} AuxVars[] AssignedVars[]" "[524] L1255-->L1255-1: Formula: (= |v_#pthreadsForks_1| |v_ULTIMATE.start_main_#t~pre39#1_2|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre39#1]" "[424] L1255-1-->L1255-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[421] L1255-2-->L1255-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_5| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre39#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| .cse1 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|))))) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int]" "[569] L1255-3-->$Ultimate##0: Formula: (and (= 0 |v_setThreadThread1of2ForFork0_#in~param.base_4|) (= |v_ULTIMATE.start_main_#t~pre39#1_14| v_setThreadThread1of2ForFork0_thidvar0_2) (= 0 |v_setThreadThread1of2ForFork0_#in~param.offset_4|)) InVars {ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_14|} OutVars{setThreadThread1of2ForFork0_~param.offset=v_setThreadThread1of2ForFork0_~param.offset_4, setThreadThread1of2ForFork0_#in~param.base=|v_setThreadThread1of2ForFork0_#in~param.base_4|, setThreadThread1of2ForFork0_#res.base=|v_setThreadThread1of2ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_14|, setThreadThread1of2ForFork0_#in~param.offset=|v_setThreadThread1of2ForFork0_#in~param.offset_4|, setThreadThread1of2ForFork0_~param.base=v_setThreadThread1of2ForFork0_~param.base_4, setThreadThread1of2ForFork0_thidvar0=v_setThreadThread1of2ForFork0_thidvar0_2, setThreadThread1of2ForFork0_#res.offset=|v_setThreadThread1of2ForFork0_#res.offset_4|} AuxVars[] AssignedVars[setThreadThread1of2ForFork0_~param.offset, setThreadThread1of2ForFork0_#in~param.base, setThreadThread1of2ForFork0_#res.base, setThreadThread1of2ForFork0_#in~param.offset, setThreadThread1of2ForFork0_~param.base, setThreadThread1of2ForFork0_thidvar0, setThreadThread1of2ForFork0_#res.offset]" "[533] $Ultimate##0-->L1282: Formula: (and (= v_setThreadThread1of2ForFork0_~param.base_1 |v_setThreadThread1of2ForFork0_#in~param.base_1|) (= v_setThreadThread1of2ForFork0_~param.offset_1 |v_setThreadThread1of2ForFork0_#in~param.offset_1|)) InVars {setThreadThread1of2ForFork0_#in~param.base=|v_setThreadThread1of2ForFork0_#in~param.base_1|, setThreadThread1of2ForFork0_#in~param.offset=|v_setThreadThread1of2ForFork0_#in~param.offset_1|} OutVars{setThreadThread1of2ForFork0_~param.base=v_setThreadThread1of2ForFork0_~param.base_1, setThreadThread1of2ForFork0_~param.offset=v_setThreadThread1of2ForFork0_~param.offset_1, setThreadThread1of2ForFork0_#in~param.base=|v_setThreadThread1of2ForFork0_#in~param.base_1|, setThreadThread1of2ForFork0_#in~param.offset=|v_setThreadThread1of2ForFork0_#in~param.offset_1|} AuxVars[] AssignedVars[setThreadThread1of2ForFork0_~param.offset, setThreadThread1of2ForFork0_~param.base]" "[534] L1282-->L1284: Formula: (= v_~a~0_1 1) InVars {} OutVars{~a~0=v_~a~0_1} AuxVars[] AssignedVars[~a~0]" "[527] L1255-4-->L1255-5: Formula: (= |v_ULTIMATE.start_main_~err~0#1_3| |v_ULTIMATE.start_main_#t~nondet40#1_2|) InVars {ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_2|} OutVars{ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_3|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~err~0#1]" "[410] L1255-5-->L1255-9: Formula: (= |v_ULTIMATE.start_main_~err~0#1_5| 0) InVars {ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_5|} OutVars{ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_5|} AuxVars[] AssignedVars[]" "[501] L1255-9-->L1255-10: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre39#1]" "[506] L1255-10-->L1255-11: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40#1]" "[430] L1255-11-->L1254-1: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| |v_ULTIMATE.start_main_#t~post42#1_2|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post42#1]" "[438] L1254-1-->L1254-2: Formula: (= (+ |v_ULTIMATE.start_main_#t~post42#1_3| 1) |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_3|} OutVars{ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[461] L1254-2-->L1254-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post42#1]" "[512] L1254-3-->L1255: Formula: (< |v_ULTIMATE.start_main_~i~0#1_4| v_~iSet~0_6) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ~iSet~0=v_~iSet~0_6} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ~iSet~0=v_~iSet~0_6} AuxVars[] AssignedVars[]" "[524] L1255-->L1255-1: Formula: (= |v_#pthreadsForks_1| |v_ULTIMATE.start_main_#t~pre39#1_2|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre39#1]" "[424] L1255-1-->L1255-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[421] L1255-2-->L1255-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_5| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre39#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| .cse1 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|))))) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int]" "[570] L1255-3-->$Ultimate##0: Formula: (and (= |v_setThreadThread2of2ForFork0_#in~param.base_4| 0) (= v_setThreadThread2of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre39#1_16|) (= |v_setThreadThread2of2ForFork0_#in~param.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_16|} OutVars{setThreadThread2of2ForFork0_#in~param.base=|v_setThreadThread2of2ForFork0_#in~param.base_4|, setThreadThread2of2ForFork0_~param.offset=v_setThreadThread2of2ForFork0_~param.offset_4, setThreadThread2of2ForFork0_thidvar0=v_setThreadThread2of2ForFork0_thidvar0_2, setThreadThread2of2ForFork0_~param.base=v_setThreadThread2of2ForFork0_~param.base_4, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_16|, setThreadThread2of2ForFork0_#in~param.offset=|v_setThreadThread2of2ForFork0_#in~param.offset_4|, setThreadThread2of2ForFork0_#res.base=|v_setThreadThread2of2ForFork0_#res.base_4|, setThreadThread2of2ForFork0_#res.offset=|v_setThreadThread2of2ForFork0_#res.offset_4|} AuxVars[] AssignedVars[setThreadThread2of2ForFork0_#in~param.base, setThreadThread2of2ForFork0_~param.offset, setThreadThread2of2ForFork0_thidvar0, setThreadThread2of2ForFork0_~param.base, setThreadThread2of2ForFork0_#in~param.offset, setThreadThread2of2ForFork0_#res.base, setThreadThread2of2ForFork0_#res.offset]" "[538] $Ultimate##0-->L1282: Formula: (and (= |v_setThreadThread2of2ForFork0_#in~param.offset_1| v_setThreadThread2of2ForFork0_~param.offset_1) (= |v_setThreadThread2of2ForFork0_#in~param.base_1| v_setThreadThread2of2ForFork0_~param.base_1)) InVars {setThreadThread2of2ForFork0_#in~param.base=|v_setThreadThread2of2ForFork0_#in~param.base_1|, setThreadThread2of2ForFork0_#in~param.offset=|v_setThreadThread2of2ForFork0_#in~param.offset_1|} OutVars{setThreadThread2of2ForFork0_#in~param.base=|v_setThreadThread2of2ForFork0_#in~param.base_1|, setThreadThread2of2ForFork0_~param.offset=v_setThreadThread2of2ForFork0_~param.offset_1, setThreadThread2of2ForFork0_~param.base=v_setThreadThread2of2ForFork0_~param.base_1, setThreadThread2of2ForFork0_#in~param.offset=|v_setThreadThread2of2ForFork0_#in~param.offset_1|} AuxVars[] AssignedVars[setThreadThread2of2ForFork0_~param.offset, setThreadThread2of2ForFork0_~param.base]" "[539] L1282-->L1284: Formula: (= v_~a~0_1 1) InVars {} OutVars{~a~0=v_~a~0_1} AuxVars[] AssignedVars[~a~0]" "[527] L1255-4-->L1255-5: Formula: (= |v_ULTIMATE.start_main_~err~0#1_3| |v_ULTIMATE.start_main_#t~nondet40#1_2|) InVars {ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_2|} OutVars{ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_3|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~err~0#1]" "[410] L1255-5-->L1255-9: Formula: (= |v_ULTIMATE.start_main_~err~0#1_5| 0) InVars {ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_5|} OutVars{ULTIMATE.start_main_~err~0#1=|v_ULTIMATE.start_main_~err~0#1_5|} AuxVars[] AssignedVars[]" "[501] L1255-9-->L1255-10: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre39#1]" "[506] L1255-10-->L1255-11: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40#1]" "[430] L1255-11-->L1254-1: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| |v_ULTIMATE.start_main_#t~post42#1_2|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post42#1]" "[438] L1254-1-->L1254-2: Formula: (= (+ |v_ULTIMATE.start_main_#t~post42#1_3| 1) |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_3|} OutVars{ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[461] L1254-2-->L1254-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post42#1=|v_ULTIMATE.start_main_#t~post42#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post42#1]" "[512] L1254-3-->L1255: Formula: (< |v_ULTIMATE.start_main_~i~0#1_4| v_~iSet~0_6) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ~iSet~0=v_~iSet~0_6} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ~iSet~0=v_~iSet~0_6} AuxVars[] AssignedVars[]" "[524] L1255-->L1255-1: Formula: (= |v_#pthreadsForks_1| |v_ULTIMATE.start_main_#t~pre39#1_2|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre39#1]" "[424] L1255-1-->L1255-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[421] L1255-2-->L1255-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_5| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre39#1_3|)) |v_#memory_int_3|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| .cse1 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|))))) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int]" "[567] L1255-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[535] L1284-->L1287: Formula: (= (+ v_~b~0_1 1) 0) InVars {} OutVars{~b~0=v_~b~0_1} AuxVars[] AssignedVars[~b~0]" "[540] L1284-->L1287: Formula: (= (+ v_~b~0_1 1) 0) InVars {} OutVars{~b~0=v_~b~0_1} AuxVars[] AssignedVars[~b~0]" "[536] L1287-->setThreadFINAL: Formula: (and (= |v_setThreadThread1of2ForFork0_#res.offset_1| 0) (= |v_setThreadThread1of2ForFork0_#res.base_1| 0)) InVars {} OutVars{setThreadThread1of2ForFork0_#res.base=|v_setThreadThread1of2ForFork0_#res.base_1|, setThreadThread1of2ForFork0_#res.offset=|v_setThreadThread1of2ForFork0_#res.offset_1|} AuxVars[] AssignedVars[setThreadThread1of2ForFork0_#res.base, setThreadThread1of2ForFork0_#res.offset]" "[541] L1287-->setThreadFINAL: Formula: (and (= |v_setThreadThread2of2ForFork0_#res.base_1| 0) (= |v_setThreadThread2of2ForFork0_#res.offset_1| 0)) InVars {} OutVars{setThreadThread2of2ForFork0_#res.base=|v_setThreadThread2of2ForFork0_#res.base_1|, setThreadThread2of2ForFork0_#res.offset=|v_setThreadThread2of2ForFork0_#res.offset_1|} AuxVars[] AssignedVars[setThreadThread2of2ForFork0_#res.base, setThreadThread2of2ForFork0_#res.offset]" [2025-04-26 18:16:26,340 INFO L754 eck$LassoCheckResult]: Loop: "[568] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:16:26,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:16:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash -730637954, now seen corresponding path program 1 times [2025-04-26 18:16:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:16:26,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947573777] [2025-04-26 18:16:26,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:16:26,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:16:26,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-26 18:16:26,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-26 18:16:26,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:26,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:26,375 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:16:26,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-26 18:16:26,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-26 18:16:26,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:26,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:26,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:16:26,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:16:26,398 INFO L85 PathProgramCache]: Analyzing trace with hash 599, now seen corresponding path program 1 times [2025-04-26 18:16:26,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:16:26,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020902774] [2025-04-26 18:16:26,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:16:26,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:16:26,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:16:26,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:16:26,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:26,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:26,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:16:26,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:16:26,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:16:26,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:26,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:26,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:16:26,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:16:26,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1174939526, now seen corresponding path program 1 times [2025-04-26 18:16:26,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:16:26,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759086040] [2025-04-26 18:16:26,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:16:26,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:16:26,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 18:16:26,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 18:16:26,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:26,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:26,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:16:26,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 18:16:26,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 18:16:26,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:26,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:26,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:16:27,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-26 18:16:27,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-26 18:16:27,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:27,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:27,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:16:27,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-26 18:16:27,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-26 18:16:27,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:16:27,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:16:27,659 WARN L166 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:16:27,678 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-04-26 18:16:27,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:16:27,686 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:16:27,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:16:27,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:16:27,688 INFO L229 MonitoredProcess]: Starting monitored process 4 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:16:27,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2025-04-26 18:16:27,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 187 transitions, 446 flow [2025-04-26 18:16:28,031 INFO L116 PetriNetUnfolderBase]: 497/3331 cut-off events. [2025-04-26 18:16:28,031 INFO L117 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-04-26 18:16:28,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 3331 events. 497/3331 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 25817 event pairs, 52 based on Foata normal form. 0/3015 useless extension candidates. Maximal degree in co-relation 1944. Up to 192 conditions per place. [2025-04-26 18:16:28,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 187 transitions, 446 flow [2025-04-26 18:16:28,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 187 transitions, 446 flow [2025-04-26 18:16:28,088 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 176 places, 187 transitions, 446 flow [2025-04-26 18:16:28,088 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 176 places, 187 transitions, 446 flow