/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 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:45:55,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:45:55,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:45:55,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:45:55,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:45:55,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:45:55,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:45:55,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:45:55,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:45:55,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:45:55,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:45:55,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:45:55,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:45:55,627 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:45:55,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:45:55,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:45:55,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:45:55,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:45:55,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:45:55,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:45:55,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:45:55,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:45:55,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:45:55,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:45:55,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:45:55,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:45:55,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:45:55,849 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:45:55,851 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:45:55,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2025-04-13 20:45:57,163 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e724f930d/8a178ac477fc42dea62a22aa672587c9/FLAGed6a34a5e [2025-04-13 20:45:57,387 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:45:57,387 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2025-04-13 20:45:57,394 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e724f930d/8a178ac477fc42dea62a22aa672587c9/FLAGed6a34a5e [2025-04-13 20:45:58,164 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e724f930d/8a178ac477fc42dea62a22aa672587c9 [2025-04-13 20:45:58,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:45:58,167 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:45:58,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:45:58,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:45:58,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:45:58,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42508ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58, skipping insertion in model container [2025-04-13 20:45:58,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:45:58,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2664,2677] [2025-04-13 20:45:58,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:45:58,362 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:45:58,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2664,2677] [2025-04-13 20:45:58,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:45:58,401 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:45:58,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58 WrapperNode [2025-04-13 20:45:58,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:45:58,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:45:58,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:45:58,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:45:58,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,429 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 92 [2025-04-13 20:45:58,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:45:58,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:45:58,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:45:58,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:45:58,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,450 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 20:45:58,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:45:58,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:45:58,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:45:58,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:45:58,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (1/1) ... [2025-04-13 20:45:58,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:45:58,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:58,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:45:58,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:45:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:45:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:45:58,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:45:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:45:58,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:45:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:45:58,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:45:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 20:45:58,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 20:45:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:45:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:45:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:45:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:45:58,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:45:58,509 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:45:58,591 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:45:58,593 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:45:58,762 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:45:58,762 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:45:58,763 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:45:58,901 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:45:58,906 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:45:58,909 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:45:58,913 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:45:58,919 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:45:58,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:45:58 BoogieIcfgContainer [2025-04-13 20:45:58,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:45:58,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:45:58,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:45:58,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:45:58,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:45:58" (1/3) ... [2025-04-13 20:45:58,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672d3c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:45:58, skipping insertion in model container [2025-04-13 20:45:58,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:45:58" (2/3) ... [2025-04-13 20:45:58,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672d3c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:45:58, skipping insertion in model container [2025-04-13 20:45:58,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:45:58" (3/3) ... [2025-04-13 20:45:58,925 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2025-04-13 20:45:58,934 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:45:58,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-4.wvr.c that has 5 procedures, 32 locations, 35 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 20:45:58,935 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:45:59,001 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 20:45:59,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 106 flow [2025-04-13 20:45:59,052 INFO L116 PetriNetUnfolderBase]: 8/35 cut-off events. [2025-04-13 20:45:59,056 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:45:59,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 35 events. 8/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-13 20:45:59,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 106 flow [2025-04-13 20:45:59,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 92 flow [2025-04-13 20:45:59,064 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:45:59,075 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@65f4e6d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:45:59,075 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 20:45:59,086 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:45:59,086 INFO L116 PetriNetUnfolderBase]: 8/33 cut-off events. [2025-04-13 20:45:59,086 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:45:59,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:59,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:59,087 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:45:59,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash 762255216, now seen corresponding path program 1 times [2025-04-13 20:45:59,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:59,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308896324] [2025-04-13 20:45:59,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:59,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:59,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:45:59,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:45:59,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:59,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:45:59,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:59,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308896324] [2025-04-13 20:45:59,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308896324] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:45:59,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:45:59,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:45:59,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663887204] [2025-04-13 20:45:59,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:59,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:45:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:59,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:45:59,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:45:59,427 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:45:59,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:59,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:59,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:45:59,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:59,850 INFO L116 PetriNetUnfolderBase]: 3615/4612 cut-off events. [2025-04-13 20:45:59,850 INFO L117 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-04-13 20:45:59,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9585 conditions, 4612 events. 3615/4612 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16752 event pairs, 763 based on Foata normal form. 155/3213 useless extension candidates. Maximal degree in co-relation 8466. Up to 3776 conditions per place. [2025-04-13 20:45:59,881 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 50 selfloop transitions, 3 changer transitions 2/55 dead transitions. [2025-04-13 20:45:59,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 265 flow [2025-04-13 20:45:59,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:45:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:45:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-04-13 20:45:59,893 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5982905982905983 [2025-04-13 20:45:59,894 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 92 flow. Second operand 3 states and 70 transitions. [2025-04-13 20:45:59,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 265 flow [2025-04-13 20:45:59,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 55 transitions, 235 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 20:45:59,909 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 99 flow [2025-04-13 20:45:59,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2025-04-13 20:45:59,916 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2025-04-13 20:45:59,917 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 99 flow [2025-04-13 20:45:59,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:59,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:59,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:59,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:45:59,918 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:45:59,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:59,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1854791, now seen corresponding path program 1 times [2025-04-13 20:45:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:59,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425357126] [2025-04-13 20:45:59,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:59,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:45:59,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:45:59,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:59,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:00,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:00,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425357126] [2025-04-13 20:46:00,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425357126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:46:00,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:46:00,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:46:00,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536195415] [2025-04-13 20:46:00,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:00,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:46:00,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:00,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:46:00,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:46:00,006 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:00,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:00,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:00,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:00,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:00,253 INFO L116 PetriNetUnfolderBase]: 2623/3618 cut-off events. [2025-04-13 20:46:00,254 INFO L117 PetriNetUnfolderBase]: For 225/237 co-relation queries the response was YES. [2025-04-13 20:46:00,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7833 conditions, 3618 events. 2623/3618 cut-off events. For 225/237 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 16067 event pairs, 641 based on Foata normal form. 0/2776 useless extension candidates. Maximal degree in co-relation 1415. Up to 3110 conditions per place. [2025-04-13 20:46:00,267 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 41 selfloop transitions, 4 changer transitions 2/51 dead transitions. [2025-04-13 20:46:00,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 230 flow [2025-04-13 20:46:00,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:46:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:46:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-04-13 20:46:00,268 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2025-04-13 20:46:00,268 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 99 flow. Second operand 3 states and 69 transitions. [2025-04-13 20:46:00,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 230 flow [2025-04-13 20:46:00,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 51 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:46:00,269 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 136 flow [2025-04-13 20:46:00,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2025-04-13 20:46:00,270 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-04-13 20:46:00,270 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 136 flow [2025-04-13 20:46:00,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:00,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:00,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:00,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:46:00,270 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:00,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:00,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1172635765, now seen corresponding path program 2 times [2025-04-13 20:46:00,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:00,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572261626] [2025-04-13 20:46:00,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:00,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:00,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:46:00,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:46:00,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:46:00,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:00,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:00,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572261626] [2025-04-13 20:46:00,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572261626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:46:00,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:46:00,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:46:00,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429310502] [2025-04-13 20:46:00,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:00,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:46:00,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:00,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:46:00,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:46:00,333 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:00,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:00,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:00,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:00,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:00,558 INFO L116 PetriNetUnfolderBase]: 2365/3181 cut-off events. [2025-04-13 20:46:00,559 INFO L117 PetriNetUnfolderBase]: For 910/915 co-relation queries the response was YES. [2025-04-13 20:46:00,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7597 conditions, 3181 events. 2365/3181 cut-off events. For 910/915 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12340 event pairs, 1378 based on Foata normal form. 95/2489 useless extension candidates. Maximal degree in co-relation 5599. Up to 2900 conditions per place. [2025-04-13 20:46:00,573 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 32 selfloop transitions, 0 changer transitions 19/55 dead transitions. [2025-04-13 20:46:00,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 283 flow [2025-04-13 20:46:00,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:46:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:46:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-04-13 20:46:00,575 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2025-04-13 20:46:00,575 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 136 flow. Second operand 3 states and 69 transitions. [2025-04-13 20:46:00,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 283 flow [2025-04-13 20:46:00,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:46:00,577 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 124 flow [2025-04-13 20:46:00,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2025-04-13 20:46:00,578 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2025-04-13 20:46:00,578 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 124 flow [2025-04-13 20:46:00,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:00,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:00,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:00,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:46:00,580 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:00,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1653958650, now seen corresponding path program 1 times [2025-04-13 20:46:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:00,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122086708] [2025-04-13 20:46:00,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:46:00,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:00,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:46:00,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:46:00,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:00,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:00,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:00,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122086708] [2025-04-13 20:46:00,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122086708] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:46:00,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:46:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:46:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268966433] [2025-04-13 20:46:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:00,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:46:00,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:00,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:46:00,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:46:00,750 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:46:00,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:00,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:00,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:46:00,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:01,206 INFO L116 PetriNetUnfolderBase]: 6507/8621 cut-off events. [2025-04-13 20:46:01,206 INFO L117 PetriNetUnfolderBase]: For 2836/2836 co-relation queries the response was YES. [2025-04-13 20:46:01,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20859 conditions, 8621 events. 6507/8621 cut-off events. For 2836/2836 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 36700 event pairs, 1436 based on Foata normal form. 314/7000 useless extension candidates. Maximal degree in co-relation 20853. Up to 3389 conditions per place. [2025-04-13 20:46:01,237 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 78 selfloop transitions, 9 changer transitions 2/89 dead transitions. [2025-04-13 20:46:01,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 89 transitions, 452 flow [2025-04-13 20:46:01,238 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:46:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:46:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-04-13 20:46:01,238 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2025-04-13 20:46:01,239 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 124 flow. Second operand 4 states and 102 transitions. [2025-04-13 20:46:01,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 89 transitions, 452 flow [2025-04-13 20:46:01,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 89 transitions, 440 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 20:46:01,241 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 185 flow [2025-04-13 20:46:01,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-04-13 20:46:01,241 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2025-04-13 20:46:01,241 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 185 flow [2025-04-13 20:46:01,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:01,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:01,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:01,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:46:01,242 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:01,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash 933298920, now seen corresponding path program 2 times [2025-04-13 20:46:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:01,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12349793] [2025-04-13 20:46:01,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:01,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:46:01,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:46:01,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:46:01,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:01,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:01,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12349793] [2025-04-13 20:46:01,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12349793] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:46:01,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:46:01,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:46:01,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132684784] [2025-04-13 20:46:01,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:01,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:46:01,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:01,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:46:01,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:46:01,410 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:46:01,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:01,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:01,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:46:01,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:02,386 INFO L116 PetriNetUnfolderBase]: 12710/16819 cut-off events. [2025-04-13 20:46:02,386 INFO L117 PetriNetUnfolderBase]: For 14784/14784 co-relation queries the response was YES. [2025-04-13 20:46:02,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45750 conditions, 16819 events. 12710/16819 cut-off events. For 14784/14784 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 79566 event pairs, 2488 based on Foata normal form. 314/13283 useless extension candidates. Maximal degree in co-relation 45742. Up to 5403 conditions per place. [2025-04-13 20:46:02,468 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 102 selfloop transitions, 19 changer transitions 2/123 dead transitions. [2025-04-13 20:46:02,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 123 transitions, 690 flow [2025-04-13 20:46:02,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:46:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:46:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-04-13 20:46:02,469 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6871794871794872 [2025-04-13 20:46:02,469 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 185 flow. Second operand 5 states and 134 transitions. [2025-04-13 20:46:02,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 123 transitions, 690 flow [2025-04-13 20:46:02,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 123 transitions, 682 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-13 20:46:02,474 INFO L231 Difference]: Finished difference. Result has 47 places, 52 transitions, 304 flow [2025-04-13 20:46:02,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=47, PETRI_TRANSITIONS=52} [2025-04-13 20:46:02,475 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2025-04-13 20:46:02,475 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 52 transitions, 304 flow [2025-04-13 20:46:02,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:02,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:02,475 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:46:02,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:46:02,475 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:02,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash 552885111, now seen corresponding path program 1 times [2025-04-13 20:46:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:02,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281384433] [2025-04-13 20:46:02,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:46:02,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:02,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:46:02,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:02,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:02,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:02,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:02,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281384433] [2025-04-13 20:46:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281384433] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:02,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821600581] [2025-04-13 20:46:02,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:46:02,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:02,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:02,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:02,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:46:02,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:46:02,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:02,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:02,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:02,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:02,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:02,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:02,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821600581] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:02,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:02,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-13 20:46:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186745214] [2025-04-13 20:46:02,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:02,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:46:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:02,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:46:02,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:46:02,862 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:02,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 52 transitions, 304 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:02,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:02,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:02,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:04,925 INFO L116 PetriNetUnfolderBase]: 26691/35788 cut-off events. [2025-04-13 20:46:04,925 INFO L117 PetriNetUnfolderBase]: For 44106/44911 co-relation queries the response was YES. [2025-04-13 20:46:05,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98576 conditions, 35788 events. 26691/35788 cut-off events. For 44106/44911 co-relation queries the response was YES. Maximal size of possible extension queue 1424. Compared 201082 event pairs, 3463 based on Foata normal form. 383/26868 useless extension candidates. Maximal degree in co-relation 98566. Up to 9269 conditions per place. [2025-04-13 20:46:05,123 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 199 selfloop transitions, 21 changer transitions 0/234 dead transitions. [2025-04-13 20:46:05,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 234 transitions, 1676 flow [2025-04-13 20:46:05,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:46:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:46:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2025-04-13 20:46:05,125 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5794871794871795 [2025-04-13 20:46:05,125 INFO L175 Difference]: Start difference. First operand has 47 places, 52 transitions, 304 flow. Second operand 10 states and 226 transitions. [2025-04-13 20:46:05,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 234 transitions, 1676 flow [2025-04-13 20:46:05,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 234 transitions, 1476 flow, removed 100 selfloop flow, removed 0 redundant places. [2025-04-13 20:46:05,159 INFO L231 Difference]: Finished difference. Result has 63 places, 72 transitions, 403 flow [2025-04-13 20:46:05,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=403, PETRI_PLACES=63, PETRI_TRANSITIONS=72} [2025-04-13 20:46:05,160 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2025-04-13 20:46:05,160 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 72 transitions, 403 flow [2025-04-13 20:46:05,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:05,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:05,160 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:46:05,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:46:05,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:46:05,365 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:05,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2007436901, now seen corresponding path program 2 times [2025-04-13 20:46:05,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:05,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725250570] [2025-04-13 20:46:05,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:05,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:05,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:46:05,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:05,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:05,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:05,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:05,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725250570] [2025-04-13 20:46:05,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725250570] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:05,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390453605] [2025-04-13 20:46:05,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:05,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:05,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:05,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:05,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:46:05,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:46:05,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:05,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:05,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:05,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:05,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:05,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:46:05,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390453605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:46:05,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:46:05,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-04-13 20:46:05,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33165127] [2025-04-13 20:46:05,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:05,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:46:05,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:05,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:46:05,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:46:05,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:05,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 72 transitions, 403 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:05,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:05,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:05,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:07,778 INFO L116 PetriNetUnfolderBase]: 27440/36578 cut-off events. [2025-04-13 20:46:07,778 INFO L117 PetriNetUnfolderBase]: For 76585/77602 co-relation queries the response was YES. [2025-04-13 20:46:07,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120185 conditions, 36578 events. 27440/36578 cut-off events. For 76585/77602 co-relation queries the response was YES. Maximal size of possible extension queue 1533. Compared 204720 event pairs, 8275 based on Foata normal form. 422/30309 useless extension candidates. Maximal degree in co-relation 120167. Up to 27387 conditions per place. [2025-04-13 20:46:07,978 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 105 selfloop transitions, 10 changer transitions 0/129 dead transitions. [2025-04-13 20:46:07,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 129 transitions, 891 flow [2025-04-13 20:46:07,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:46:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:46:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-13 20:46:07,981 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2025-04-13 20:46:07,981 INFO L175 Difference]: Start difference. First operand has 63 places, 72 transitions, 403 flow. Second operand 5 states and 109 transitions. [2025-04-13 20:46:07,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 129 transitions, 891 flow [2025-04-13 20:46:08,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 129 transitions, 887 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-13 20:46:08,093 INFO L231 Difference]: Finished difference. Result has 67 places, 73 transitions, 424 flow [2025-04-13 20:46:08,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=424, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2025-04-13 20:46:08,093 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 28 predicate places. [2025-04-13 20:46:08,093 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 424 flow [2025-04-13 20:46:08,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:08,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:08,094 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:46:08,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:46:08,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-13 20:46:08,294 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:08,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash -999697925, now seen corresponding path program 3 times [2025-04-13 20:46:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:08,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265966672] [2025-04-13 20:46:08,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:46:08,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:08,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:46:08,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:08,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:46:08,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:08,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:08,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265966672] [2025-04-13 20:46:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265966672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:46:08,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:46:08,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:46:08,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677119124] [2025-04-13 20:46:08,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:08,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:46:08,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:08,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:46:08,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:46:08,423 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:08,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:08,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:08,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:08,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:10,182 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][84], [60#true, Black: 68#(= ~counter~0 0), 20#L44true, 33#L76true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 56#true, 53#(<= 1 (mod ~N~0 4294967296)), Black: 49#(= ~counter~0 0), 344#true, Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 51#true, Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 69#(= ~counter~0 ~c~0), Black: 62#(= ~counter~0 0), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), Black: 75#(= thread1Thread1of1ForFork3_~i~0 0), 28#L95true, 257#true, Black: 63#(= ~counter~0 ~c~0), 13#L65true, 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 19#L55true, Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296))]) [2025-04-13 20:46:10,182 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-13 20:46:10,182 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:10,182 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:10,182 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 20:46:10,509 INFO L116 PetriNetUnfolderBase]: 31585/42002 cut-off events. [2025-04-13 20:46:10,509 INFO L117 PetriNetUnfolderBase]: For 94838/96129 co-relation queries the response was YES. [2025-04-13 20:46:10,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142839 conditions, 42002 events. 31585/42002 cut-off events. For 94838/96129 co-relation queries the response was YES. Maximal size of possible extension queue 1807. Compared 236865 event pairs, 10250 based on Foata normal form. 648/34798 useless extension candidates. Maximal degree in co-relation 142820. Up to 28567 conditions per place. [2025-04-13 20:46:10,779 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 103 selfloop transitions, 18 changer transitions 0/135 dead transitions. [2025-04-13 20:46:10,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 135 transitions, 1032 flow [2025-04-13 20:46:10,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:46:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:46:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-13 20:46:10,780 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.517948717948718 [2025-04-13 20:46:10,780 INFO L175 Difference]: Start difference. First operand has 67 places, 73 transitions, 424 flow. Second operand 5 states and 101 transitions. [2025-04-13 20:46:10,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 135 transitions, 1032 flow [2025-04-13 20:46:10,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 135 transitions, 1003 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:46:10,906 INFO L231 Difference]: Finished difference. Result has 71 places, 84 transitions, 525 flow [2025-04-13 20:46:10,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=525, PETRI_PLACES=71, PETRI_TRANSITIONS=84} [2025-04-13 20:46:10,906 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2025-04-13 20:46:10,907 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 84 transitions, 525 flow [2025-04-13 20:46:10,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:10,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:10,907 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:46:10,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:46:10,907 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:10,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2032595047, now seen corresponding path program 4 times [2025-04-13 20:46:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:10,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578100517] [2025-04-13 20:46:10,908 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:46:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:10,914 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:46:10,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:10,923 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:46:10,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:11,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:11,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578100517] [2025-04-13 20:46:11,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578100517] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:46:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:46:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:46:11,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183940724] [2025-04-13 20:46:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:11,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:46:11,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:11,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:46:11,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:46:11,045 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:11,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 84 transitions, 525 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:11,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:11,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:11,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:13,425 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][108], [60#true, Black: 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 24#L52true, 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), Black: 51#true, 69#(= ~counter~0 ~c~0), Black: 62#(= ~counter~0 0), Black: 75#(= thread1Thread1of1ForFork3_~i~0 0), 7#L94-4true, 351#true, 228#(< 0 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 68#(= ~counter~0 0), 53#(<= 1 (mod ~N~0 4294967296)), 344#true, Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), Black: 63#(= ~counter~0 ~c~0), 13#L65true]) [2025-04-13 20:46:13,425 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-13 20:46:13,425 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:13,425 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:13,425 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 20:46:13,426 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([320] L52-->L55: Formula: (and (= v_~counter~0_80 (+ v_~c~0_52 v_~counter~0_79)) (not (= (ite (< 0 (mod v_~counter~0_80 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_52, ~counter~0=v_~counter~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_79, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~c~0=v_~c~0_52} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][35], [60#true, Black: 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), Black: 51#true, 69#(= ~counter~0 ~c~0), Black: 62#(= ~counter~0 0), Black: 75#(= thread1Thread1of1ForFork3_~i~0 0), 7#L94-4true, 351#true, 19#L55true, 228#(< 0 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), 23#L73true, Black: 68#(= ~counter~0 0), 53#(<= 1 (mod ~N~0 4294967296)), 344#true, Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), Black: 63#(= ~counter~0 ~c~0), 13#L65true]) [2025-04-13 20:46:13,426 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-13 20:46:13,426 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:13,426 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:13,426 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 20:46:13,703 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][108], [60#true, Black: 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 24#L52true, 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), Black: 51#true, 69#(= ~counter~0 ~c~0), Black: 62#(= ~counter~0 0), Black: 75#(= thread1Thread1of1ForFork3_~i~0 0), 351#true, 228#(< 0 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 68#(= ~counter~0 0), 53#(<= 1 (mod ~N~0 4294967296)), 344#true, Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, Black: 63#(= ~counter~0 ~c~0), 13#L65true]) [2025-04-13 20:46:13,703 INFO L286 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-04-13 20:46:13,703 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:46:13,703 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-13 20:46:13,703 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:46:13,703 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([320] L52-->L55: Formula: (and (= v_~counter~0_80 (+ v_~c~0_52 v_~counter~0_79)) (not (= (ite (< 0 (mod v_~counter~0_80 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_52, ~counter~0=v_~counter~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_79, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~c~0=v_~c~0_52} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][35], [60#true, Black: 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), Black: 51#true, 69#(= ~counter~0 ~c~0), Black: 62#(= ~counter~0 0), Black: 75#(= thread1Thread1of1ForFork3_~i~0 0), 351#true, 19#L55true, 228#(< 0 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), 23#L73true, Black: 68#(= ~counter~0 0), 53#(<= 1 (mod ~N~0 4294967296)), 344#true, Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, Black: 63#(= ~counter~0 ~c~0), 13#L65true]) [2025-04-13 20:46:13,703 INFO L286 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-04-13 20:46:13,703 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:46:13,703 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-13 20:46:13,703 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:46:13,853 INFO L116 PetriNetUnfolderBase]: 36174/47891 cut-off events. [2025-04-13 20:46:13,853 INFO L117 PetriNetUnfolderBase]: For 115298/116788 co-relation queries the response was YES. [2025-04-13 20:46:13,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175044 conditions, 47891 events. 36174/47891 cut-off events. For 115298/116788 co-relation queries the response was YES. Maximal size of possible extension queue 2031. Compared 270252 event pairs, 12170 based on Foata normal form. 613/40148 useless extension candidates. Maximal degree in co-relation 175023. Up to 30204 conditions per place. [2025-04-13 20:46:14,129 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 114 selfloop transitions, 37 changer transitions 0/165 dead transitions. [2025-04-13 20:46:14,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 165 transitions, 1324 flow [2025-04-13 20:46:14,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:46:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:46:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-04-13 20:46:14,130 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2025-04-13 20:46:14,130 INFO L175 Difference]: Start difference. First operand has 71 places, 84 transitions, 525 flow. Second operand 5 states and 108 transitions. [2025-04-13 20:46:14,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 165 transitions, 1324 flow [2025-04-13 20:46:14,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 165 transitions, 1296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:46:14,341 INFO L231 Difference]: Finished difference. Result has 77 places, 106 transitions, 785 flow [2025-04-13 20:46:14,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=785, PETRI_PLACES=77, PETRI_TRANSITIONS=106} [2025-04-13 20:46:14,341 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 38 predicate places. [2025-04-13 20:46:14,341 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 106 transitions, 785 flow [2025-04-13 20:46:14,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:14,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:14,341 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:46:14,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:46:14,342 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:14,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash -170001367, now seen corresponding path program 5 times [2025-04-13 20:46:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:14,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429746476] [2025-04-13 20:46:14,342 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:14,347 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:46:14,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:14,352 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:14,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:14,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:14,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429746476] [2025-04-13 20:46:14,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429746476] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:14,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793477607] [2025-04-13 20:46:14,441 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:14,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:14,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:14,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:14,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:46:14,480 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:46:14,494 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:14,494 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:14,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:14,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:14,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:14,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:14,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793477607] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:14,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:14,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-13 20:46:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118761081] [2025-04-13 20:46:14,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:14,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:46:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:14,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:46:14,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:46:14,627 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:14,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 106 transitions, 785 flow. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:14,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:14,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:14,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:16,719 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][144], [60#true, 24#L52true, 361#(= thread1Thread1of1ForFork3_~i~0 0), 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, 259#(= thread1Thread1of1ForFork3_~i~0 0), Black: 49#(= ~counter~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), 69#(= ~counter~0 ~c~0), 353#(= thread1Thread1of1ForFork3_~i~0 0), 7#L94-4true, Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0))]) [2025-04-13 20:46:16,719 INFO L286 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-04-13 20:46:16,719 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:16,719 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:16,720 INFO L289 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2025-04-13 20:46:16,720 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([320] L52-->L55: Formula: (and (= v_~counter~0_80 (+ v_~c~0_52 v_~counter~0_79)) (not (= (ite (< 0 (mod v_~counter~0_80 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_52, ~counter~0=v_~counter~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_79, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~c~0=v_~c~0_52} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][93], [60#true, 361#(= thread1Thread1of1ForFork3_~i~0 0), 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, 259#(= thread1Thread1of1ForFork3_~i~0 0), Black: 49#(= ~counter~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), 69#(= ~counter~0 ~c~0), 353#(= thread1Thread1of1ForFork3_~i~0 0), 7#L94-4true, 19#L55true, Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), 23#L73true, 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0))]) [2025-04-13 20:46:16,720 INFO L286 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-04-13 20:46:16,720 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:16,720 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:16,720 INFO L289 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2025-04-13 20:46:17,115 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][144], [60#true, 24#L52true, 33#L76true, 361#(= thread1Thread1of1ForFork3_~i~0 0), 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, 259#(= thread1Thread1of1ForFork3_~i~0 0), Black: 49#(= ~counter~0 0), Black: 51#true, 69#(= ~counter~0 ~c~0), Black: 62#(= ~counter~0 0), 353#(= thread1Thread1of1ForFork3_~i~0 0), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0))]) [2025-04-13 20:46:17,115 INFO L286 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-04-13 20:46:17,115 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:46:17,115 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:46:17,115 INFO L289 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-04-13 20:46:17,115 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([320] L52-->L55: Formula: (and (= v_~counter~0_80 (+ v_~c~0_52 v_~counter~0_79)) (not (= (ite (< 0 (mod v_~counter~0_80 4294967296)) 1 0) 0))) InVars {~c~0=v_~c~0_52, ~counter~0=v_~counter~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~counter~0=v_~counter~0_79, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~c~0=v_~c~0_52} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][93], [60#true, 361#(= thread1Thread1of1ForFork3_~i~0 0), 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, 259#(= thread1Thread1of1ForFork3_~i~0 0), Black: 49#(= ~counter~0 0), Black: 51#true, 69#(= ~counter~0 ~c~0), Black: 62#(= ~counter~0 0), 353#(= thread1Thread1of1ForFork3_~i~0 0), 19#L55true, 23#L73true, Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0))]) [2025-04-13 20:46:17,115 INFO L286 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-04-13 20:46:17,116 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:46:17,116 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:46:17,116 INFO L289 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-04-13 20:46:18,576 INFO L116 PetriNetUnfolderBase]: 46502/62375 cut-off events. [2025-04-13 20:46:18,576 INFO L117 PetriNetUnfolderBase]: For 198841/200831 co-relation queries the response was YES. [2025-04-13 20:46:18,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257056 conditions, 62375 events. 46502/62375 cut-off events. For 198841/200831 co-relation queries the response was YES. Maximal size of possible extension queue 2621. Compared 377452 event pairs, 7543 based on Foata normal form. 871/53968 useless extension candidates. Maximal degree in co-relation 257032. Up to 17551 conditions per place. [2025-04-13 20:46:19,020 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 170 selfloop transitions, 43 changer transitions 0/227 dead transitions. [2025-04-13 20:46:19,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 227 transitions, 1900 flow [2025-04-13 20:46:19,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:46:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:46:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2025-04-13 20:46:19,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2025-04-13 20:46:19,022 INFO L175 Difference]: Start difference. First operand has 77 places, 106 transitions, 785 flow. Second operand 7 states and 161 transitions. [2025-04-13 20:46:19,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 227 transitions, 1900 flow [2025-04-13 20:46:19,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 227 transitions, 1868 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:46:19,507 INFO L231 Difference]: Finished difference. Result has 84 places, 114 transitions, 912 flow [2025-04-13 20:46:19,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=912, PETRI_PLACES=84, PETRI_TRANSITIONS=114} [2025-04-13 20:46:19,508 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2025-04-13 20:46:19,508 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 114 transitions, 912 flow [2025-04-13 20:46:19,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:19,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:19,508 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:46:19,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:46:19,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:19,709 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:19,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1620664329, now seen corresponding path program 6 times [2025-04-13 20:46:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:19,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977740239] [2025-04-13 20:46:19,710 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:46:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:19,717 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:46:19,726 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:19,726 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:46:19,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:19,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:19,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977740239] [2025-04-13 20:46:19,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977740239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:46:19,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:46:19,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:46:19,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449617151] [2025-04-13 20:46:19,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:19,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:46:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:19,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:46:19,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:46:19,801 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:19,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 114 transitions, 912 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:19,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:19,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:19,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:23,762 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][114], [60#true, Black: 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), 69#(= ~counter~0 ~c~0), Black: 75#(= thread1Thread1of1ForFork3_~i~0 0), 19#L55true, Black: 353#(= thread1Thread1of1ForFork3_~i~0 0), 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), Black: 68#(= ~counter~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 537#true, Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 531#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0))]) [2025-04-13 20:46:23,762 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-13 20:46:23,762 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 20:46:23,762 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:23,762 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:24,261 INFO L116 PetriNetUnfolderBase]: 47796/63808 cut-off events. [2025-04-13 20:46:24,261 INFO L117 PetriNetUnfolderBase]: For 274898/277479 co-relation queries the response was YES. [2025-04-13 20:46:24,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287055 conditions, 63808 events. 47796/63808 cut-off events. For 274898/277479 co-relation queries the response was YES. Maximal size of possible extension queue 2759. Compared 382803 event pairs, 17605 based on Foata normal form. 985/54599 useless extension candidates. Maximal degree in co-relation 287029. Up to 46165 conditions per place. [2025-04-13 20:46:24,756 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 123 selfloop transitions, 31 changer transitions 13/181 dead transitions. [2025-04-13 20:46:24,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 181 transitions, 1713 flow [2025-04-13 20:46:24,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:46:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:46:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-04-13 20:46:24,758 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5435897435897435 [2025-04-13 20:46:24,758 INFO L175 Difference]: Start difference. First operand has 84 places, 114 transitions, 912 flow. Second operand 5 states and 106 transitions. [2025-04-13 20:46:24,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 181 transitions, 1713 flow [2025-04-13 20:46:26,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 181 transitions, 1637 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-13 20:46:26,019 INFO L231 Difference]: Finished difference. Result has 86 places, 114 transitions, 916 flow [2025-04-13 20:46:26,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=916, PETRI_PLACES=86, PETRI_TRANSITIONS=114} [2025-04-13 20:46:26,019 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2025-04-13 20:46:26,019 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 114 transitions, 916 flow [2025-04-13 20:46:26,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:26,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:26,019 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:46:26,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:46:26,020 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:26,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1074202167, now seen corresponding path program 1 times [2025-04-13 20:46:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:26,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461328950] [2025-04-13 20:46:26,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:46:26,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:26,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:46:26,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:26,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:26,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:26,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:26,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461328950] [2025-04-13 20:46:26,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461328950] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:26,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217420043] [2025-04-13 20:46:26,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:46:26,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:26,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:26,117 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:26,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:46:26,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:46:26,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:26,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:26,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:26,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:26,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:26,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:26,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217420043] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:26,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:26,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-13 20:46:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651602213] [2025-04-13 20:46:26,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:26,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:46:26,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:26,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:46:26,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:46:26,338 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:26,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 114 transitions, 916 flow. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:26,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:26,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:26,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:31,644 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][124], [60#true, Black: 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 20#L44true, 33#L76true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), 69#(= ~counter~0 ~c~0), Black: 75#(= thread1Thread1of1ForFork3_~i~0 0), 19#L55true, 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), Black: 68#(= ~counter~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 542#true, Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), 537#true, Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 531#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0))]) [2025-04-13 20:46:31,645 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-13 20:46:31,645 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:31,645 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 20:46:31,645 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:32,715 INFO L116 PetriNetUnfolderBase]: 68757/92192 cut-off events. [2025-04-13 20:46:32,715 INFO L117 PetriNetUnfolderBase]: For 398548/401711 co-relation queries the response was YES. [2025-04-13 20:46:33,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416741 conditions, 92192 events. 68757/92192 cut-off events. For 398548/401711 co-relation queries the response was YES. Maximal size of possible extension queue 3946. Compared 582868 event pairs, 17665 based on Foata normal form. 2062/78609 useless extension candidates. Maximal degree in co-relation 416715. Up to 49477 conditions per place. [2025-04-13 20:46:33,451 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 193 selfloop transitions, 61 changer transitions 0/268 dead transitions. [2025-04-13 20:46:33,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 268 transitions, 2560 flow [2025-04-13 20:46:33,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:46:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:46:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2025-04-13 20:46:33,452 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-04-13 20:46:33,452 INFO L175 Difference]: Start difference. First operand has 86 places, 114 transitions, 916 flow. Second operand 8 states and 169 transitions. [2025-04-13 20:46:33,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 268 transitions, 2560 flow [2025-04-13 20:46:34,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 268 transitions, 2448 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 20:46:34,588 INFO L231 Difference]: Finished difference. Result has 92 places, 145 transitions, 1323 flow [2025-04-13 20:46:34,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1323, PETRI_PLACES=92, PETRI_TRANSITIONS=145} [2025-04-13 20:46:34,588 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2025-04-13 20:46:34,589 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 145 transitions, 1323 flow [2025-04-13 20:46:34,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:34,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:34,589 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:46:34,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:46:34,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:34,790 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:34,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1834514665, now seen corresponding path program 2 times [2025-04-13 20:46:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:34,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867524924] [2025-04-13 20:46:34,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:34,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:34,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:46:34,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:34,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:34,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:34,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:34,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867524924] [2025-04-13 20:46:34,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867524924] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:34,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231401429] [2025-04-13 20:46:34,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:46:34,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:34,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:34,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:34,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:46:34,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:46:34,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:34,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:34,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:34,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:34,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:35,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:46:35,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231401429] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:46:35,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:46:35,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-04-13 20:46:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167708768] [2025-04-13 20:46:35,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:35,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:46:35,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:35,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:46:35,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:46:35,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:35,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 145 transitions, 1323 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:35,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:35,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:35,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:40,525 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][176], [60#true, 20#L44true, 33#L76true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, 259#(= thread1Thread1of1ForFork3_~i~0 0), 66#true, Black: 49#(= ~counter~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), 7#L94-4true, 539#(= thread1Thread1of1ForFork3_~i~0 0), Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), Black: 63#(= ~counter~0 ~c~0), 13#L65true, Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 724#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:46:40,529 INFO L286 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2025-04-13 20:46:40,529 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:40,529 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:40,529 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:40,567 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][176], [60#true, 20#L44true, 33#L76true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, 66#true, Black: 49#(= ~counter~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), 7#L94-4true, Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), 539#(= thread1Thread1of1ForFork3_~i~0 0), 261#(and (<= (+ (mod ~N~0 4294967296) (mod (+ (* 4294967295 ~N~0) 1) 4294967296)) 1) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), Black: 63#(= ~counter~0 ~c~0), 13#L65true, Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 724#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:46:40,567 INFO L286 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2025-04-13 20:46:40,567 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:40,567 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:40,567 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:40,866 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][125], [60#true, Black: 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 722#true, Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), Black: 51#true, 69#(= ~counter~0 ~c~0), Black: 62#(= ~counter~0 0), Black: 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), 19#L55true, 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 542#true, Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 531#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0))]) [2025-04-13 20:46:40,866 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-13 20:46:40,866 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 20:46:40,866 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:40,866 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:40,964 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][176], [60#true, 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, 66#true, Black: 49#(= ~counter~0 0), 259#(= thread1Thread1of1ForFork3_~i~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), 539#(= thread1Thread1of1ForFork3_~i~0 0), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 724#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:46:40,964 INFO L286 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2025-04-13 20:46:40,964 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:40,964 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:40,964 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:40,992 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][176], [60#true, 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, 66#true, Black: 49#(= ~counter~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), 539#(= thread1Thread1of1ForFork3_~i~0 0), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), 261#(and (<= (+ (mod ~N~0 4294967296) (mod (+ (* 4294967295 ~N~0) 1) 4294967296)) 1) (= thread1Thread1of1ForFork3_~i~0 0)), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 724#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:46:40,993 INFO L286 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2025-04-13 20:46:40,993 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:40,993 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:40,993 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:41,678 INFO L116 PetriNetUnfolderBase]: 68609/91777 cut-off events. [2025-04-13 20:46:41,678 INFO L117 PetriNetUnfolderBase]: For 571111/575172 co-relation queries the response was YES. [2025-04-13 20:46:42,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443145 conditions, 91777 events. 68609/91777 cut-off events. For 571111/575172 co-relation queries the response was YES. Maximal size of possible extension queue 4099. Compared 578436 event pairs, 22877 based on Foata normal form. 1698/84081 useless extension candidates. Maximal degree in co-relation 443117. Up to 42759 conditions per place. [2025-04-13 20:46:42,475 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 121 selfloop transitions, 53 changer transitions 23/211 dead transitions. [2025-04-13 20:46:42,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 211 transitions, 2106 flow [2025-04-13 20:46:42,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:46:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:46:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-04-13 20:46:42,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5948717948717949 [2025-04-13 20:46:42,476 INFO L175 Difference]: Start difference. First operand has 92 places, 145 transitions, 1323 flow. Second operand 5 states and 116 transitions. [2025-04-13 20:46:42,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 211 transitions, 2106 flow [2025-04-13 20:46:45,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 211 transitions, 2058 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-13 20:46:45,793 INFO L231 Difference]: Finished difference. Result has 97 places, 145 transitions, 1414 flow [2025-04-13 20:46:45,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1414, PETRI_PLACES=97, PETRI_TRANSITIONS=145} [2025-04-13 20:46:45,794 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 58 predicate places. [2025-04-13 20:46:45,794 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 145 transitions, 1414 flow [2025-04-13 20:46:45,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:45,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:45,794 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:46:45,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:46:45,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 20:46:45,995 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:45,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:45,995 INFO L85 PathProgramCache]: Analyzing trace with hash 401795031, now seen corresponding path program 3 times [2025-04-13 20:46:45,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:45,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823690257] [2025-04-13 20:46:45,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:46:45,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:46,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:46:46,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:46,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:46:46,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:46,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:46,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823690257] [2025-04-13 20:46:46,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823690257] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:46,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742986620] [2025-04-13 20:46:46,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:46:46,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:46,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:46,148 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:46,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:46:46,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:46:46,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:46,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:46:46,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:46,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:46:46,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:46,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:46:46,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742986620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:46:46,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:46:46,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2025-04-13 20:46:46,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513408554] [2025-04-13 20:46:46,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:46,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:46:46,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:46,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:46:46,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:46:46,245 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:46,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 145 transitions, 1414 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:46,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:46,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:46,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:51,501 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][169], [60#true, 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 764#(and (<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, 66#true, Black: 49#(= ~counter~0 0), 259#(= thread1Thread1of1ForFork3_~i~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), 7#L94-4true, 539#(= thread1Thread1of1ForFork3_~i~0 0), Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 725#(<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), Black: 63#(= ~counter~0 ~c~0), 13#L65true, Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 814#(= thread1Thread1of1ForFork3_~i~0 0), 724#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:46:51,501 INFO L286 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2025-04-13 20:46:51,501 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:51,501 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:51,502 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:51,530 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][169], [60#true, 20#L44true, 33#L76true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 764#(and (<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), 66#true, Black: 51#true, Black: 62#(= ~counter~0 0), 7#L94-4true, 539#(= thread1Thread1of1ForFork3_~i~0 0), Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), 261#(and (<= (+ (mod ~N~0 4294967296) (mod (+ (* 4294967295 ~N~0) 1) 4294967296)) 1) (= thread1Thread1of1ForFork3_~i~0 0)), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), Black: 725#(<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 814#(= thread1Thread1of1ForFork3_~i~0 0), 724#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:46:51,530 INFO L286 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2025-04-13 20:46:51,530 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:51,530 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:51,530 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:46:51,778 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][123], [60#true, Black: 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 722#true, Black: 764#(and (<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), 69#(= ~counter~0 ~c~0), Black: 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 19#L55true, Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), 542#true, Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), Black: 725#(<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, 812#true, 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 531#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0))]) [2025-04-13 20:46:51,778 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-13 20:46:51,778 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:51,778 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:46:51,778 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 20:46:51,890 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][169], [60#true, 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 764#(and (<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 66#true, 56#true, 259#(= thread1Thread1of1ForFork3_~i~0 0), Black: 49#(= ~counter~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), 539#(= thread1Thread1of1ForFork3_~i~0 0), Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 725#(<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 814#(= thread1Thread1of1ForFork3_~i~0 0), 724#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:46:51,891 INFO L286 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2025-04-13 20:46:51,891 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:51,891 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:51,891 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:51,914 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][169], [60#true, 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 764#(and (<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), 66#true, Black: 51#true, Black: 62#(= ~counter~0 0), Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), 539#(= thread1Thread1of1ForFork3_~i~0 0), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), 261#(and (<= (+ (mod ~N~0 4294967296) (mod (+ (* 4294967295 ~N~0) 1) 4294967296)) 1) (= thread1Thread1of1ForFork3_~i~0 0)), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), Black: 725#(<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, Black: 63#(= ~counter~0 ~c~0), 13#L65true, Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 814#(= thread1Thread1of1ForFork3_~i~0 0), 724#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:46:51,914 INFO L286 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2025-04-13 20:46:51,914 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:51,914 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:51,915 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:46:52,728 INFO L116 PetriNetUnfolderBase]: 69037/92175 cut-off events. [2025-04-13 20:46:52,728 INFO L117 PetriNetUnfolderBase]: For 630331/634673 co-relation queries the response was YES. [2025-04-13 20:46:53,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442296 conditions, 92175 events. 69037/92175 cut-off events. For 630331/634673 co-relation queries the response was YES. Maximal size of possible extension queue 4115. Compared 578883 event pairs, 22850 based on Foata normal form. 1825/86021 useless extension candidates. Maximal degree in co-relation 442265. Up to 49576 conditions per place. [2025-04-13 20:46:53,670 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 113 selfloop transitions, 47 changer transitions 27/201 dead transitions. [2025-04-13 20:46:53,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 201 transitions, 2139 flow [2025-04-13 20:46:53,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:46:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:46:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-04-13 20:46:53,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2025-04-13 20:46:53,672 INFO L175 Difference]: Start difference. First operand has 97 places, 145 transitions, 1414 flow. Second operand 5 states and 108 transitions. [2025-04-13 20:46:53,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 201 transitions, 2139 flow [2025-04-13 20:46:56,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 201 transitions, 2052 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 20:46:56,276 INFO L231 Difference]: Finished difference. Result has 98 places, 136 transitions, 1309 flow [2025-04-13 20:46:56,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1309, PETRI_PLACES=98, PETRI_TRANSITIONS=136} [2025-04-13 20:46:56,277 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2025-04-13 20:46:56,277 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 136 transitions, 1309 flow [2025-04-13 20:46:56,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:56,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:56,277 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:46:56,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:46:56,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:56,478 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:46:56,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash 132326705, now seen corresponding path program 7 times [2025-04-13 20:46:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:56,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223993408] [2025-04-13 20:46:56,479 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:46:56,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:56,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:46:56,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:46:56,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:46:56,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:56,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:56,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223993408] [2025-04-13 20:46:56,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223993408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:46:56,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:46:56,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:46:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346278141] [2025-04-13 20:46:56,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:46:56,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:46:56,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:56,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:46:56,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:46:56,575 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:46:56,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 136 transitions, 1309 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:56,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:56,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:46:56,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:01,921 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][189], [60#true, 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 906#(= thread1Thread1of1ForFork3_~i~0 0), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, 66#true, 259#(= thread1Thread1of1ForFork3_~i~0 0), Black: 49#(= ~counter~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), 7#L94-4true, Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), 539#(= thread1Thread1of1ForFork3_~i~0 0), Black: 875#(and (<= (mod ~N~0 4294967296) 1) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 725#(<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), Black: 63#(= ~counter~0 ~c~0), 13#L65true, Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 814#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:47:01,921 INFO L286 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2025-04-13 20:47:01,921 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:47:01,921 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:47:01,921 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:47:01,960 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][189], [60#true, 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 906#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), 66#true, Black: 51#true, Black: 62#(= ~counter~0 0), 7#L94-4true, Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), 539#(= thread1Thread1of1ForFork3_~i~0 0), Black: 875#(and (<= (mod ~N~0 4294967296) 1) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), 261#(and (<= (+ (mod ~N~0 4294967296) (mod (+ (* 4294967295 ~N~0) 1) 4294967296)) 1) (= thread1Thread1of1ForFork3_~i~0 0)), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), Black: 725#(<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 814#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:47:01,960 INFO L286 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2025-04-13 20:47:01,960 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:47:01,960 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:47:01,960 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-04-13 20:47:02,578 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][189], [60#true, 33#L76true, 20#L44true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 906#(= thread1Thread1of1ForFork3_~i~0 0), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, 66#true, 259#(= thread1Thread1of1ForFork3_~i~0 0), Black: 49#(= ~counter~0 0), Black: 51#true, Black: 62#(= ~counter~0 0), Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), 539#(= thread1Thread1of1ForFork3_~i~0 0), Black: 875#(and (<= (mod ~N~0 4294967296) 1) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 725#(<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, 13#L65true, Black: 63#(= ~counter~0 ~c~0), Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 814#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:47:02,578 INFO L286 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2025-04-13 20:47:02,578 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:47:02,578 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:47:02,578 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:47:02,602 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L73-->L76: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_74 4294967296)) 1 0) 0)) (= (+ v_~c~0_50 v_~counter~0_73) v_~counter~0_74)) InVars {~c~0=v_~c~0_50, ~counter~0=v_~counter~0_74} OutVars{~counter~0=v_~counter~0_73, ~c~0=v_~c~0_50, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][189], [60#true, 20#L44true, 33#L76true, Black: 247#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 346#(= thread1Thread1of1ForFork3_~i~0 0), 906#(= thread1Thread1of1ForFork3_~i~0 0), 56#true, Black: 49#(= ~counter~0 0), 66#true, Black: 51#true, Black: 62#(= ~counter~0 0), 539#(= thread1Thread1of1ForFork3_~i~0 0), Black: 715#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 875#(and (<= (mod ~N~0 4294967296) 1) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 355#(and (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) (div (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2 thread3Thread1of1ForFork2_~i~2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0))), Black: 202#(< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~N~0 4294967296)), 261#(and (<= (+ (mod ~N~0 4294967296) (mod (+ (* 4294967295 ~N~0) 1) 4294967296)) 1) (= thread1Thread1of1ForFork3_~i~0 0)), 75#(= thread1Thread1of1ForFork3_~i~0 0), Black: 68#(= ~counter~0 0), Black: 544#(= thread1Thread1of1ForFork3_~i~0 0), Black: 534#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (= thread3Thread1of1ForFork2_~i~2 0) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0)), 53#(<= 1 (mod ~N~0 4294967296)), Black: 245#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod thread1Thread1of1ForFork3_~i~0 4294967296) 2) (+ (mod ~N~0 4294967296) thread1Thread1of1ForFork3_~i~0)) (<= (div thread1Thread1of1ForFork3_~i~0 4294967296) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 76#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 249#(and (<= 1 (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296)) (<= (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1) (mod ~N~0 4294967296)) (<= (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod (+ thread1Thread1of1ForFork3_~i~0 1) 4294967296))), Black: 401#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 2 (mod ~N~0 4294967296))), Black: 725#(<= 0 (div (+ (* (- 1) (mod ~N~0 4294967296)) 1) 8589934592)), 719#(and (<= 1 (mod (+ thread3Thread1of1ForFork2_~i~2 1) 4294967296)) (= thread1Thread1of1ForFork3_~i~0 0) (<= 2 (mod ~N~0 4294967296))), 4#thread2EXITtrue, 347#(and (= |thread4Thread1of1ForFork0_~i~3#1| 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 105#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 (mod ~N~0 4294967296))), 28#L95true, Black: 63#(= ~counter~0 ~c~0), 13#L65true, Black: 354#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), 814#(= thread1Thread1of1ForFork3_~i~0 0)]) [2025-04-13 20:47:02,602 INFO L286 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2025-04-13 20:47:02,602 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:47:02,602 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:47:02,602 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2025-04-13 20:47:03,487 INFO L116 PetriNetUnfolderBase]: 75957/101957 cut-off events. [2025-04-13 20:47:03,488 INFO L117 PetriNetUnfolderBase]: For 704518/708618 co-relation queries the response was YES. [2025-04-13 20:47:03,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488820 conditions, 101957 events. 75957/101957 cut-off events. For 704518/708618 co-relation queries the response was YES. Maximal size of possible extension queue 4480. Compared 655239 event pairs, 22266 based on Foata normal form. 3076/96294 useless extension candidates. Maximal degree in co-relation 488789. Up to 47272 conditions per place. [2025-04-13 20:47:04,541 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 160 selfloop transitions, 54 changer transitions 0/228 dead transitions. [2025-04-13 20:47:04,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 228 transitions, 2317 flow [2025-04-13 20:47:04,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:47:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:47:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-04-13 20:47:04,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-04-13 20:47:04,542 INFO L175 Difference]: Start difference. First operand has 98 places, 136 transitions, 1309 flow. Second operand 6 states and 129 transitions. [2025-04-13 20:47:04,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 228 transitions, 2317 flow [2025-04-13 20:47:07,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 228 transitions, 2215 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-13 20:47:07,408 INFO L231 Difference]: Finished difference. Result has 99 places, 137 transitions, 1343 flow [2025-04-13 20:47:07,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1343, PETRI_PLACES=99, PETRI_TRANSITIONS=137} [2025-04-13 20:47:07,408 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 60 predicate places. [2025-04-13 20:47:07,408 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 137 transitions, 1343 flow [2025-04-13 20:47:07,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:07,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:07,409 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:47:07,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:47:07,409 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:47:07,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:07,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1547461643, now seen corresponding path program 4 times [2025-04-13 20:47:07,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:07,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890469358] [2025-04-13 20:47:07,409 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:47:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:07,413 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:47:07,418 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:47:07,418 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:47:07,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:07,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:07,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890469358] [2025-04-13 20:47:07,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890469358] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:47:07,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:47:07,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:47:07,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144265564] [2025-04-13 20:47:07,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:47:07,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:47:07,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:07,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:47:07,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:47:07,484 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:47:07,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 137 transitions, 1343 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:07,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:07,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:47:07,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:18,469 INFO L116 PetriNetUnfolderBase]: 122034/163032 cut-off events. [2025-04-13 20:47:18,469 INFO L117 PetriNetUnfolderBase]: For 1168801/1175349 co-relation queries the response was YES. [2025-04-13 20:47:19,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788532 conditions, 163032 events. 122034/163032 cut-off events. For 1168801/1175349 co-relation queries the response was YES. Maximal size of possible extension queue 6618. Compared 1090282 event pairs, 25723 based on Foata normal form. 4788/155629 useless extension candidates. Maximal degree in co-relation 788501. Up to 69996 conditions per place. [2025-04-13 20:47:19,997 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 259 selfloop transitions, 44 changer transitions 0/317 dead transitions. [2025-04-13 20:47:19,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 317 transitions, 3697 flow [2025-04-13 20:47:19,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:47:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:47:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-04-13 20:47:19,998 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5487179487179488 [2025-04-13 20:47:19,998 INFO L175 Difference]: Start difference. First operand has 99 places, 137 transitions, 1343 flow. Second operand 5 states and 107 transitions. [2025-04-13 20:47:19,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 317 transitions, 3697 flow [2025-04-13 20:47:40,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 317 transitions, 3435 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-04-13 20:47:40,814 INFO L231 Difference]: Finished difference. Result has 102 places, 169 transitions, 1669 flow [2025-04-13 20:47:40,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1669, PETRI_PLACES=102, PETRI_TRANSITIONS=169} [2025-04-13 20:47:40,814 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 63 predicate places. [2025-04-13 20:47:40,815 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 169 transitions, 1669 flow [2025-04-13 20:47:40,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:40,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:40,815 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:47:40,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:47:40,815 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:47:40,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash -4672537, now seen corresponding path program 5 times [2025-04-13 20:47:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:40,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664425329] [2025-04-13 20:47:40,815 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:47:40,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:40,819 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:47:40,822 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:47:40,822 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:47:40,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:40,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:40,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664425329] [2025-04-13 20:47:40,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664425329] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:47:40,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819015024] [2025-04-13 20:47:40,884 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:47:40,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:40,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:40,885 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:47:40,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:47:40,927 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:47:40,945 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:47:40,945 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:47:40,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:40,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:47:40,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:47:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:41,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819015024] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:47:41,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:47:41,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-13 20:47:41,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552452393] [2025-04-13 20:47:41,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:47:41,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:47:41,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:41,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:47:41,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:47:41,062 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:47:41,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 169 transitions, 1669 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:41,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:41,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:47:41,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:55,784 INFO L116 PetriNetUnfolderBase]: 151113/201777 cut-off events. [2025-04-13 20:47:55,785 INFO L117 PetriNetUnfolderBase]: For 1738288/1745314 co-relation queries the response was YES. [2025-04-13 20:47:56,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048687 conditions, 201777 events. 151113/201777 cut-off events. For 1738288/1745314 co-relation queries the response was YES. Maximal size of possible extension queue 7741. Compared 1361530 event pairs, 25727 based on Foata normal form. 6859/194308 useless extension candidates. Maximal degree in co-relation 1048653. Up to 78866 conditions per place. [2025-04-13 20:47:57,750 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 353 selfloop transitions, 107 changer transitions 0/474 dead transitions. [2025-04-13 20:47:57,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 474 transitions, 5389 flow [2025-04-13 20:47:57,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:47:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:47:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2025-04-13 20:47:57,751 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5544871794871795 [2025-04-13 20:47:57,751 INFO L175 Difference]: Start difference. First operand has 102 places, 169 transitions, 1669 flow. Second operand 8 states and 173 transitions. [2025-04-13 20:47:57,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 474 transitions, 5389 flow [2025-04-13 20:48:23,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 474 transitions, 5363 flow, removed 13 selfloop flow, removed 0 redundant places. [2025-04-13 20:48:23,473 INFO L231 Difference]: Finished difference. Result has 113 places, 235 transitions, 2626 flow [2025-04-13 20:48:23,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1618, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2626, PETRI_PLACES=113, PETRI_TRANSITIONS=235} [2025-04-13 20:48:23,473 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 74 predicate places. [2025-04-13 20:48:23,473 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 235 transitions, 2626 flow [2025-04-13 20:48:23,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:23,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:23,474 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-13 20:48:23,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 20:48:23,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:48:23,674 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:48:23,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash -951495423, now seen corresponding path program 8 times [2025-04-13 20:48:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:23,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869297599] [2025-04-13 20:48:23,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:48:23,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:23,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:48:23,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:48:23,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:48:23,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:23,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:23,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869297599] [2025-04-13 20:48:23,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869297599] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:48:23,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269857340] [2025-04-13 20:48:23,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:48:23,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:48:23,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:48:23,791 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:48:23,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:48:23,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:48:23,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:48:23,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:48:23,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:23,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:48:23,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:48:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:23,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:48:23,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269857340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:48:23,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:48:23,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2025-04-13 20:48:23,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113164890] [2025-04-13 20:48:23,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:48:23,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:48:23,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:23,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:48:23,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:48:23,885 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 20:48:23,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 235 transitions, 2626 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:23,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:23,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 20:48:23,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand