/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/pthread-wmm/safe016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:36:38,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:36:38,205 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 19:36:38,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:36:38,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:36:38,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:36:38,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:36:38,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:36:38,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:36:38,224 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:36:38,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:36:38,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:36:38,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:36:38,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:36:38,224 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:36:38,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:36:38,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:36:38,224 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:36:38,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:36:38,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:38,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:36:38,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:36:38,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:36:38,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:36:38,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:38,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:36:38,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:36:38,226 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:36:38,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:36:38,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:36:38,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:36:38,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:36:38,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:36:38,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:36:38,226 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 19:36:38,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:36:38,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:36:38,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:36:38,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:36:38,443 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:36:38,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2025-04-13 19:36:39,731 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d066b84/e7c2333ae37047b4824a284d2cda0e20/FLAGc2af7ebe5 [2025-04-13 19:36:39,979 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:36:39,980 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2025-04-13 19:36:39,989 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d066b84/e7c2333ae37047b4824a284d2cda0e20/FLAGc2af7ebe5 [2025-04-13 19:36:40,782 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d066b84/e7c2333ae37047b4824a284d2cda0e20 [2025-04-13 19:36:40,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:36:40,785 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:36:40,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:36:40,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:36:40,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:36:40,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:36:40" (1/1) ... [2025-04-13 19:36:40,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d286c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:40, skipping insertion in model container [2025-04-13 19:36:40,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:36:40" (1/1) ... [2025-04-13 19:36:40,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:36:41,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i[995,1008] [2025-04-13 19:36:41,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:36:41,230 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:36:41,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i[995,1008] [2025-04-13 19:36:41,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:36:41,343 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:36:41,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41 WrapperNode [2025-04-13 19:36:41,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:36:41,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:36:41,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:36:41,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:36:41,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,382 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 174 [2025-04-13 19:36:41,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:36:41,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:36:41,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:36:41,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:36:41,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,413 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2025-04-13 19:36:41,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:36:41,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:36:41,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:36:41,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:36:41,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (1/1) ... [2025-04-13 19:36:41,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:41,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:36:41,466 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 19:36:41,469 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 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:36:41,488 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:36:41,488 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:36:41,488 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 19:36:41,488 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:36:41,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:36:41,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:36:41,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:36:41,490 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 19:36:41,605 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:36:41,606 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:36:41,965 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:36:41,965 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:36:41,965 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:36:42,323 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:36:42,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:36:42 BoogieIcfgContainer [2025-04-13 19:36:42,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:36:42,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:36:42,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:36:42,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:36:42,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:36:40" (1/3) ... [2025-04-13 19:36:42,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405d2132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:36:42, skipping insertion in model container [2025-04-13 19:36:42,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:41" (2/3) ... [2025-04-13 19:36:42,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405d2132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:36:42, skipping insertion in model container [2025-04-13 19:36:42,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:36:42" (3/3) ... [2025-04-13 19:36:42,331 INFO L128 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2025-04-13 19:36:42,343 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:36:42,346 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe016_power.oepc.i that has 5 procedures, 42 locations, 37 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:36:42,347 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:36:42,409 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:36:42,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 98 flow [2025-04-13 19:36:42,471 INFO L116 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-04-13 19:36:42,474 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:36:42,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:36:42,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 41 transitions, 98 flow [2025-04-13 19:36:42,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 36 transitions, 84 flow [2025-04-13 19:36:42,481 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:36:42,488 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;@3e3da2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:36:42,488 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:36:42,502 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:36:42,502 INFO L116 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-04-13 19:36:42,502 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:36:42,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:42,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:42,503 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 19:36:42,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1546393213, now seen corresponding path program 1 times [2025-04-13 19:36:42,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:42,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099484796] [2025-04-13 19:36:42,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:42,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:42,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:36:42,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:36:42,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:42,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:43,171 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 19:36:43,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:43,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099484796] [2025-04-13 19:36:43,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099484796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:43,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:43,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:36:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154079323] [2025-04-13 19:36:43,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:43,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:43,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:43,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:43,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:43,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2025-04-13 19:36:43,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 19:36:43,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:43,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2025-04-13 19:36:43,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:44,224 INFO L116 PetriNetUnfolderBase]: 3593/5607 cut-off events. [2025-04-13 19:36:44,225 INFO L117 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-04-13 19:36:44,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10745 conditions, 5607 events. 3593/5607 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 35826 event pairs, 1335 based on Foata normal form. 192/5717 useless extension candidates. Maximal degree in co-relation 10733. Up to 4009 conditions per place. [2025-04-13 19:36:44,261 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 39 selfloop transitions, 3 changer transitions 21/75 dead transitions. [2025-04-13 19:36:44,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 297 flow [2025-04-13 19:36:44,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-04-13 19:36:44,276 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2025-04-13 19:36:44,277 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 84 flow. Second operand 5 states and 145 transitions. [2025-04-13 19:36:44,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 297 flow [2025-04-13 19:36:44,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 290 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:44,284 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 107 flow [2025-04-13 19:36:44,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2025-04-13 19:36:44,289 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2025-04-13 19:36:44,290 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 107 flow [2025-04-13 19:36:44,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 19:36:44,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:44,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:44,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:36:44,290 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 19:36:44,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash -24192508, now seen corresponding path program 1 times [2025-04-13 19:36:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:44,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278439618] [2025-04-13 19:36:44,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:44,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:36:44,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:36:44,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:44,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:44,552 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 19:36:44,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:44,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278439618] [2025-04-13 19:36:44,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278439618] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:44,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:44,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:36:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119370852] [2025-04-13 19:36:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:44,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:44,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:44,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:44,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:44,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2025-04-13 19:36:44,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 19:36:44,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:44,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2025-04-13 19:36:44,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:45,275 INFO L116 PetriNetUnfolderBase]: 2654/4099 cut-off events. [2025-04-13 19:36:45,275 INFO L117 PetriNetUnfolderBase]: For 1035/1035 co-relation queries the response was YES. [2025-04-13 19:36:45,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8666 conditions, 4099 events. 2654/4099 cut-off events. For 1035/1035 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 28087 event pairs, 509 based on Foata normal form. 168/4043 useless extension candidates. Maximal degree in co-relation 8653. Up to 2833 conditions per place. [2025-04-13 19:36:45,299 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 32 selfloop transitions, 2 changer transitions 17/66 dead transitions. [2025-04-13 19:36:45,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 269 flow [2025-04-13 19:36:45,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-04-13 19:36:45,301 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6731707317073171 [2025-04-13 19:36:45,301 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 107 flow. Second operand 5 states and 138 transitions. [2025-04-13 19:36:45,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 269 flow [2025-04-13 19:36:45,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 264 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:36:45,308 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 114 flow [2025-04-13 19:36:45,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2025-04-13 19:36:45,308 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-04-13 19:36:45,308 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 114 flow [2025-04-13 19:36:45,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 19:36:45,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:45,309 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 19:36:45,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:36:45,309 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 19:36:45,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1625399579, now seen corresponding path program 1 times [2025-04-13 19:36:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:45,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372370603] [2025-04-13 19:36:45,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:45,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:36:45,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:36:45,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:45,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:45,544 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 19:36:45,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:45,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372370603] [2025-04-13 19:36:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372370603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:45,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862534672] [2025-04-13 19:36:45,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:45,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:45,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:45,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:45,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:45,552 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-04-13 19:36:45,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 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 19:36:45,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:45,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-04-13 19:36:45,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:46,557 INFO L116 PetriNetUnfolderBase]: 6055/9535 cut-off events. [2025-04-13 19:36:46,557 INFO L117 PetriNetUnfolderBase]: For 3965/3965 co-relation queries the response was YES. [2025-04-13 19:36:46,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21673 conditions, 9535 events. 6055/9535 cut-off events. For 3965/3965 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 67360 event pairs, 743 based on Foata normal form. 160/9576 useless extension candidates. Maximal degree in co-relation 21657. Up to 3913 conditions per place. [2025-04-13 19:36:46,590 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 49 selfloop transitions, 4 changer transitions 19/83 dead transitions. [2025-04-13 19:36:46,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 379 flow [2025-04-13 19:36:46,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2025-04-13 19:36:46,595 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7219512195121951 [2025-04-13 19:36:46,595 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 114 flow. Second operand 5 states and 148 transitions. [2025-04-13 19:36:46,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 379 flow [2025-04-13 19:36:46,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 369 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:46,609 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 121 flow [2025-04-13 19:36:46,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2025-04-13 19:36:46,611 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-04-13 19:36:46,611 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 121 flow [2025-04-13 19:36:46,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 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 19:36:46,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:46,611 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 19:36:46,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:36:46,611 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 19:36:46,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1773009179, now seen corresponding path program 2 times [2025-04-13 19:36:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:46,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478628628] [2025-04-13 19:36:46,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:36:46,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:46,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:36:46,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:36:46,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:36:46,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:46,901 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 19:36:46,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:46,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478628628] [2025-04-13 19:36:46,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478628628] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:46,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:46,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:36:46,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026169544] [2025-04-13 19:36:46,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:46,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:46,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:46,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:46,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:46,903 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-04-13 19:36:46,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 19:36:46,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:46,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-04-13 19:36:46,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:47,362 INFO L116 PetriNetUnfolderBase]: 2395/3979 cut-off events. [2025-04-13 19:36:47,363 INFO L117 PetriNetUnfolderBase]: For 1957/1980 co-relation queries the response was YES. [2025-04-13 19:36:47,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8807 conditions, 3979 events. 2395/3979 cut-off events. For 1957/1980 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 27046 event pairs, 811 based on Foata normal form. 128/3970 useless extension candidates. Maximal degree in co-relation 8791. Up to 2473 conditions per place. [2025-04-13 19:36:47,386 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 36 selfloop transitions, 2 changer transitions 17/71 dead transitions. [2025-04-13 19:36:47,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 309 flow [2025-04-13 19:36:47,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-04-13 19:36:47,388 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7170731707317073 [2025-04-13 19:36:47,388 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 121 flow. Second operand 5 states and 147 transitions. [2025-04-13 19:36:47,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 309 flow [2025-04-13 19:36:47,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 295 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:47,396 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 121 flow [2025-04-13 19:36:47,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2025-04-13 19:36:47,397 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2025-04-13 19:36:47,397 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 121 flow [2025-04-13 19:36:47,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 19:36:47,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:47,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:47,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:36:47,397 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 19:36:47,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash 803941241, now seen corresponding path program 1 times [2025-04-13 19:36:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:47,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986165546] [2025-04-13 19:36:47,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:47,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:47,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:36:47,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:36:47,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:47,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:47,647 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 19:36:47,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:47,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986165546] [2025-04-13 19:36:47,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986165546] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:47,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:47,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:36:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126225689] [2025-04-13 19:36:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:47,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:47,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:47,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:47,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:47,653 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-04-13 19:36:47,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 19:36:47,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:47,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-04-13 19:36:47,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:48,804 INFO L116 PetriNetUnfolderBase]: 5843/9505 cut-off events. [2025-04-13 19:36:48,805 INFO L117 PetriNetUnfolderBase]: For 4276/4278 co-relation queries the response was YES. [2025-04-13 19:36:48,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21222 conditions, 9505 events. 5843/9505 cut-off events. For 4276/4278 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 73523 event pairs, 1951 based on Foata normal form. 225/9612 useless extension candidates. Maximal degree in co-relation 21205. Up to 3173 conditions per place. [2025-04-13 19:36:48,834 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 42 selfloop transitions, 3 changer transitions 56/112 dead transitions. [2025-04-13 19:36:48,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 112 transitions, 515 flow [2025-04-13 19:36:48,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:36:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:36:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 223 transitions. [2025-04-13 19:36:48,835 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6798780487804879 [2025-04-13 19:36:48,835 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 121 flow. Second operand 8 states and 223 transitions. [2025-04-13 19:36:48,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 112 transitions, 515 flow [2025-04-13 19:36:48,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 112 transitions, 497 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:48,856 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 134 flow [2025-04-13 19:36:48,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=134, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2025-04-13 19:36:48,858 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2025-04-13 19:36:48,858 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 134 flow [2025-04-13 19:36:48,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 19:36:48,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:48,858 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 19:36:48,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:36:48,858 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 19:36:48,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:48,859 INFO L85 PathProgramCache]: Analyzing trace with hash 630672934, now seen corresponding path program 1 times [2025-04-13 19:36:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:48,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204059870] [2025-04-13 19:36:48,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:48,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:36:48,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:36:48,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:48,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:50,164 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 19:36:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:50,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204059870] [2025-04-13 19:36:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204059870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:50,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:50,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:36:50,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821168522] [2025-04-13 19:36:50,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:50,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:36:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:50,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:36:50,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:36:50,177 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2025-04-13 19:36:50,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 38 transitions, 134 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 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 19:36:50,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:50,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2025-04-13 19:36:50,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:50,803 INFO L116 PetriNetUnfolderBase]: 3359/5417 cut-off events. [2025-04-13 19:36:50,803 INFO L117 PetriNetUnfolderBase]: For 7271/7292 co-relation queries the response was YES. [2025-04-13 19:36:50,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12941 conditions, 5417 events. 3359/5417 cut-off events. For 7271/7292 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 37221 event pairs, 863 based on Foata normal form. 160/5495 useless extension candidates. Maximal degree in co-relation 12921. Up to 4095 conditions per place. [2025-04-13 19:36:50,822 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 43 selfloop transitions, 6 changer transitions 18/79 dead transitions. [2025-04-13 19:36:50,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 79 transitions, 405 flow [2025-04-13 19:36:50,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:36:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:36:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2025-04-13 19:36:50,825 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6585365853658537 [2025-04-13 19:36:50,825 INFO L175 Difference]: Start difference. First operand has 64 places, 38 transitions, 134 flow. Second operand 6 states and 162 transitions. [2025-04-13 19:36:50,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 79 transitions, 405 flow [2025-04-13 19:36:50,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 379 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-04-13 19:36:50,834 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 174 flow [2025-04-13 19:36:50,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2025-04-13 19:36:50,834 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-04-13 19:36:50,834 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 174 flow [2025-04-13 19:36:50,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 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 19:36:50,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:50,835 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] [2025-04-13 19:36:50,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:36:50,835 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 19:36:50,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash 173999213, now seen corresponding path program 1 times [2025-04-13 19:36:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:50,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136003181] [2025-04-13 19:36:50,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:50,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:36:50,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:36:50,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:50,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:51,331 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 19:36:51,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:51,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136003181] [2025-04-13 19:36:51,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136003181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:51,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:51,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:36:51,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655940649] [2025-04-13 19:36:51,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:51,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:36:51,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:51,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:36:51,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:36:51,342 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2025-04-13 19:36:51,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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 19:36:51,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:51,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2025-04-13 19:36:51,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:52,020 INFO L116 PetriNetUnfolderBase]: 3560/5754 cut-off events. [2025-04-13 19:36:52,020 INFO L117 PetriNetUnfolderBase]: For 6578/6596 co-relation queries the response was YES. [2025-04-13 19:36:52,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14845 conditions, 5754 events. 3560/5754 cut-off events. For 6578/6596 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 40210 event pairs, 1098 based on Foata normal form. 120/5765 useless extension candidates. Maximal degree in co-relation 14825. Up to 2577 conditions per place. [2025-04-13 19:36:52,044 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 48 selfloop transitions, 14 changer transitions 16/90 dead transitions. [2025-04-13 19:36:52,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 90 transitions, 484 flow [2025-04-13 19:36:52,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:36:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:36:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2025-04-13 19:36:52,046 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6480836236933798 [2025-04-13 19:36:52,046 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 174 flow. Second operand 7 states and 186 transitions. [2025-04-13 19:36:52,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 90 transitions, 484 flow [2025-04-13 19:36:52,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 90 transitions, 474 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-13 19:36:52,051 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 265 flow [2025-04-13 19:36:52,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=265, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2025-04-13 19:36:52,051 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2025-04-13 19:36:52,051 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 265 flow [2025-04-13 19:36:52,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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 19:36:52,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:52,052 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] [2025-04-13 19:36:52,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:36:52,052 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 19:36:52,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:52,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1439866719, now seen corresponding path program 2 times [2025-04-13 19:36:52,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:52,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883968740] [2025-04-13 19:36:52,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:36:52,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:52,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:36:52,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:36:52,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:36:52,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:52,678 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 19:36:52,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:52,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883968740] [2025-04-13 19:36:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883968740] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:52,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:52,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:36:52,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934421248] [2025-04-13 19:36:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:52,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:36:52,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:52,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:36:52,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:36:52,691 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2025-04-13 19:36:52,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 265 flow. Second operand has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 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 19:36:52,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:52,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2025-04-13 19:36:52,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:53,616 INFO L116 PetriNetUnfolderBase]: 4334/7002 cut-off events. [2025-04-13 19:36:53,617 INFO L117 PetriNetUnfolderBase]: For 13043/13061 co-relation queries the response was YES. [2025-04-13 19:36:53,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21482 conditions, 7002 events. 4334/7002 cut-off events. For 13043/13061 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 50520 event pairs, 811 based on Foata normal form. 174/7067 useless extension candidates. Maximal degree in co-relation 21457. Up to 2035 conditions per place. [2025-04-13 19:36:53,650 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 59 selfloop transitions, 16 changer transitions 24/111 dead transitions. [2025-04-13 19:36:53,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 111 transitions, 704 flow [2025-04-13 19:36:53,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:36:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:36:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2025-04-13 19:36:53,652 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6531165311653117 [2025-04-13 19:36:53,652 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 265 flow. Second operand 9 states and 241 transitions. [2025-04-13 19:36:53,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 111 transitions, 704 flow [2025-04-13 19:36:53,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 671 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:53,665 INFO L231 Difference]: Finished difference. Result has 75 places, 51 transitions, 305 flow [2025-04-13 19:36:53,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=305, PETRI_PLACES=75, PETRI_TRANSITIONS=51} [2025-04-13 19:36:53,665 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2025-04-13 19:36:53,665 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 51 transitions, 305 flow [2025-04-13 19:36:53,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 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 19:36:53,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:53,666 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] [2025-04-13 19:36:53,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:36:53,666 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 19:36:53,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1099170247, now seen corresponding path program 1 times [2025-04-13 19:36:53,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:53,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091100624] [2025-04-13 19:36:53,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:53,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:36:53,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:36:53,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:53,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:53,819 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 19:36:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:53,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091100624] [2025-04-13 19:36:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091100624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:53,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:53,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:53,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695288190] [2025-04-13 19:36:53,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:53,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:53,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:53,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:53,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:53,824 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-13 19:36:53,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 51 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 19:36:53,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:53,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-13 19:36:53,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:55,801 INFO L116 PetriNetUnfolderBase]: 16779/23566 cut-off events. [2025-04-13 19:36:55,801 INFO L117 PetriNetUnfolderBase]: For 33198/33711 co-relation queries the response was YES. [2025-04-13 19:36:55,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65376 conditions, 23566 events. 16779/23566 cut-off events. For 33198/33711 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 151675 event pairs, 2689 based on Foata normal form. 976/24425 useless extension candidates. Maximal degree in co-relation 65349. Up to 13796 conditions per place. [2025-04-13 19:36:55,935 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 70 selfloop transitions, 6 changer transitions 6/97 dead transitions. [2025-04-13 19:36:55,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 97 transitions, 713 flow [2025-04-13 19:36:55,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:36:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:36:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-04-13 19:36:55,936 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.676829268292683 [2025-04-13 19:36:55,937 INFO L175 Difference]: Start difference. First operand has 75 places, 51 transitions, 305 flow. Second operand 4 states and 111 transitions. [2025-04-13 19:36:55,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 97 transitions, 713 flow [2025-04-13 19:36:55,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 627 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-04-13 19:36:55,990 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 303 flow [2025-04-13 19:36:55,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=303, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-04-13 19:36:55,991 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2025-04-13 19:36:55,991 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 303 flow [2025-04-13 19:36:55,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 19:36:55,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:55,991 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] [2025-04-13 19:36:55,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:36:55,991 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 19:36:55,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:55,992 INFO L85 PathProgramCache]: Analyzing trace with hash -922265666, now seen corresponding path program 1 times [2025-04-13 19:36:55,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:55,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333888460] [2025-04-13 19:36:55,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:55,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:56,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:36:56,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:36:56,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:56,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:56,184 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 19:36:56,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:56,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333888460] [2025-04-13 19:36:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333888460] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:56,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:56,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:36:56,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471781457] [2025-04-13 19:36:56,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:56,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:56,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:56,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:56,196 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-13 19:36:56,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 19:36:56,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:56,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-13 19:36:56,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:58,142 INFO L116 PetriNetUnfolderBase]: 15068/21605 cut-off events. [2025-04-13 19:36:58,142 INFO L117 PetriNetUnfolderBase]: For 22534/22911 co-relation queries the response was YES. [2025-04-13 19:36:58,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63889 conditions, 21605 events. 15068/21605 cut-off events. For 22534/22911 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 140839 event pairs, 1331 based on Foata normal form. 937/22433 useless extension candidates. Maximal degree in co-relation 63864. Up to 9321 conditions per place. [2025-04-13 19:36:58,250 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 86 selfloop transitions, 10 changer transitions 11/122 dead transitions. [2025-04-13 19:36:58,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 122 transitions, 836 flow [2025-04-13 19:36:58,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-04-13 19:36:58,251 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.697560975609756 [2025-04-13 19:36:58,251 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 303 flow. Second operand 5 states and 143 transitions. [2025-04-13 19:36:58,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 122 transitions, 836 flow [2025-04-13 19:36:58,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:36:58,269 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 368 flow [2025-04-13 19:36:58,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2025-04-13 19:36:58,270 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2025-04-13 19:36:58,271 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 368 flow [2025-04-13 19:36:58,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 19:36:58,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:58,271 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 19:36:58,271 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:36:58,271 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 19:36:58,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1196786567, now seen corresponding path program 1 times [2025-04-13 19:36:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:58,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158298682] [2025-04-13 19:36:58,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:58,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 19:36:58,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 19:36:58,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:58,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:58,469 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 19:36:58,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:58,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158298682] [2025-04-13 19:36:58,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158298682] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:58,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:58,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:36:58,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640338185] [2025-04-13 19:36:58,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:58,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:36:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:58,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:36:58,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:36:58,482 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-13 19:36:58,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 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 19:36:58,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:58,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-13 19:36:58,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:59,992 INFO L116 PetriNetUnfolderBase]: 12144/17717 cut-off events. [2025-04-13 19:36:59,992 INFO L117 PetriNetUnfolderBase]: For 30441/30844 co-relation queries the response was YES. [2025-04-13 19:37:00,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58557 conditions, 17717 events. 12144/17717 cut-off events. For 30441/30844 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 115683 event pairs, 663 based on Foata normal form. 725/18341 useless extension candidates. Maximal degree in co-relation 58529. Up to 5706 conditions per place. [2025-04-13 19:37:00,054 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 92 selfloop transitions, 14 changer transitions 15/136 dead transitions. [2025-04-13 19:37:00,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 136 transitions, 973 flow [2025-04-13 19:37:00,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-04-13 19:37:00,056 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7032520325203252 [2025-04-13 19:37:00,056 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 368 flow. Second operand 6 states and 173 transitions. [2025-04-13 19:37:00,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 136 transitions, 973 flow [2025-04-13 19:37:00,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 136 transitions, 957 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:00,071 INFO L231 Difference]: Finished difference. Result has 79 places, 63 transitions, 418 flow [2025-04-13 19:37:00,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=418, PETRI_PLACES=79, PETRI_TRANSITIONS=63} [2025-04-13 19:37:00,071 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 30 predicate places. [2025-04-13 19:37:00,071 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 418 flow [2025-04-13 19:37:00,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 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 19:37:00,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:00,071 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, 1, 1, 1] [2025-04-13 19:37:00,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:37:00,072 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 19:37:00,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:00,072 INFO L85 PathProgramCache]: Analyzing trace with hash 798671302, now seen corresponding path program 1 times [2025-04-13 19:37:00,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:00,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467974438] [2025-04-13 19:37:00,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:00,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:37:00,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:37:00,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:00,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:00,313 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 19:37:00,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:00,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467974438] [2025-04-13 19:37:00,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467974438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:00,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:00,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:37:00,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191772722] [2025-04-13 19:37:00,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:00,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:37:00,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:00,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:37:00,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:37:00,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-13 19:37:00,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 63 transitions, 418 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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 19:37:00,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:00,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-13 19:37:00,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:02,046 INFO L116 PetriNetUnfolderBase]: 9933/14708 cut-off events. [2025-04-13 19:37:02,046 INFO L117 PetriNetUnfolderBase]: For 40591/40924 co-relation queries the response was YES. [2025-04-13 19:37:02,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53338 conditions, 14708 events. 9933/14708 cut-off events. For 40591/40924 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 97322 event pairs, 709 based on Foata normal form. 339/14944 useless extension candidates. Maximal degree in co-relation 53308. Up to 5302 conditions per place. [2025-04-13 19:37:02,131 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 70 selfloop transitions, 18 changer transitions 25/123 dead transitions. [2025-04-13 19:37:02,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 123 transitions, 886 flow [2025-04-13 19:37:02,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:37:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:37:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2025-04-13 19:37:02,133 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6376306620209059 [2025-04-13 19:37:02,133 INFO L175 Difference]: Start difference. First operand has 79 places, 63 transitions, 418 flow. Second operand 7 states and 183 transitions. [2025-04-13 19:37:02,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 123 transitions, 886 flow [2025-04-13 19:37:02,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 123 transitions, 791 flow, removed 23 selfloop flow, removed 8 redundant places. [2025-04-13 19:37:02,241 INFO L231 Difference]: Finished difference. Result has 79 places, 51 transitions, 325 flow [2025-04-13 19:37:02,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=325, PETRI_PLACES=79, PETRI_TRANSITIONS=51} [2025-04-13 19:37:02,242 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 30 predicate places. [2025-04-13 19:37:02,242 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 51 transitions, 325 flow [2025-04-13 19:37:02,242 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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 19:37:02,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:02,242 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, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:02,242 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:37:02,242 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 19:37:02,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:02,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1970588560, now seen corresponding path program 1 times [2025-04-13 19:37:02,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:02,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816809089] [2025-04-13 19:37:02,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:02,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 19:37:02,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:37:02,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:02,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:37:02,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:37:02,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 19:37:02,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:37:02,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:02,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:37:02,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:37:02,419 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:37:02,420 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 19:37:02,421 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 19:37:02,422 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 19:37:02,422 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 19:37:02,422 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 19:37:02,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:37:02,422 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:02,543 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:37:02,543 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:37:02,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:37:02 BasicIcfg [2025-04-13 19:37:02,549 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:37:02,549 INFO L158 Benchmark]: Toolchain (without parser) took 21764.43ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 107.5MB in the beginning and 1.0GB in the end (delta: -936.9MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-04-13 19:37:02,550 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:37:02,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.55ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 79.1MB in the end (delta: 28.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:37:02,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.65ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 76.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:37:02,552 INFO L158 Benchmark]: Boogie Preprocessor took 56.32ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 71.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:37:02,552 INFO L158 Benchmark]: RCFGBuilder took 883.29ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 51.3MB in the end (delta: 20.1MB). Peak memory consumption was 49.1MB. Max. memory is 8.0GB. [2025-04-13 19:37:02,552 INFO L158 Benchmark]: TraceAbstraction took 20223.97ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 51.3MB in the beginning and 1.0GB in the end (delta: -993.0MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-04-13 19:37:02,553 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 556.55ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 79.1MB in the end (delta: 28.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.65ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 76.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.32ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 71.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 883.29ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 51.3MB in the end (delta: 20.1MB). Peak memory consumption was 49.1MB. Max. memory is 8.0GB. * TraceAbstraction took 20223.97ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 51.3MB in the beginning and 1.0GB in the end (delta: -993.0MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2145; [L853] FCALL, FORK 0 pthread_create(&t2145, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2145=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] EXPR 1 \read(y) [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L770] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L771] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L772] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L773] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L777] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L778] EXPR 1 \read(y) [L778] 1 __unbuffered_p0_EAX = y [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] EXPR 1 \read(y) [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] 1 y = y$flush_delayed ? y$mem_tmp : y [L780] 1 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L783] 1 x = 1 VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t2146; [L855] FCALL, FORK 0 pthread_create(&t2146, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145=-3, t2146=-2, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t2147; [L857] FCALL, FORK 0 pthread_create(&t2147, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145=-3, t2146=-2, t2147=-1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] 0 pthread_t t2148; [L859] FCALL, FORK 0 pthread_create(&t2148, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145=-3, t2146=-2, t2147=-1, t2148=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 4 y = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 \read(y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L832] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L833] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L834] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2145=-3, t2146=-2, t2147=-1, t2148=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 \read(y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2145=-3, t2146=-2, t2147=-1, t2148=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(y) [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 \read(y) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 x == 2 && y == 2 [L885] EXPR 0 x == 2 && y == 2 [L885] EXPR 0 \read(y) [L885] EXPR 0 x == 2 && y == 2 [L885] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] 0 y = y$flush_delayed ? y$mem_tmp : y [L887] 0 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2145=-3, t2146=-2, t2147=-1, t2148=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 72 locations, 67 edges, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 842 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 807 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1586 IncrementalHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 35 mSDtfsCounter, 1586 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=11, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 1646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 19:37:02,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...