/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/mix007.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:27:06,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:27:06,570 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:27:06,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:27:06,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:27:06,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:27:06,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:27:06,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:27:06,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:27:06,596 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:27:06,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:27:06,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:27:06,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:27:06,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:27:06,597 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:27:06,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:27:06,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:27:06,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:27:06,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:27:06,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:27:06,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:27:06,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:27:06,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:27:06,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:27:06,599 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:27:06,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:27:06,599 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:27:06,599 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:27:06,599 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:27:06,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:27:06,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:27:06,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:27:06,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:27:06,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:27:06,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:27:06,600 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:27:06,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:27:06,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:27:06,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:27:06,810 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:27:06,810 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:27:06,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2025-04-13 19:27:08,076 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbd371e5/a863e724d9804231b4882c04d28d46fa/FLAGbbddf4ff6 [2025-04-13 19:27:08,339 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:27:08,347 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2025-04-13 19:27:08,360 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbd371e5/a863e724d9804231b4882c04d28d46fa/FLAGbbddf4ff6 [2025-04-13 19:27:09,126 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbd371e5/a863e724d9804231b4882c04d28d46fa [2025-04-13 19:27:09,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:27:09,130 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:27:09,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:27:09,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:27:09,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:27:09,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34063511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09, skipping insertion in model container [2025-04-13 19:27:09,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:27:09,318 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/mix007.oepc.i[945,958] [2025-04-13 19:27:09,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:27:09,484 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:27:09,503 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/mix007.oepc.i[945,958] [2025-04-13 19:27:09,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:27:09,572 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:27:09,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09 WrapperNode [2025-04-13 19:27:09,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:27:09,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:27:09,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:27:09,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:27:09,577 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:27:09" (1/1) ... [2025-04-13 19:27:09,593 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:27:09" (1/1) ... [2025-04-13 19:27:09,610 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-04-13 19:27:09,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:27:09,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:27:09,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:27:09,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:27:09,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,642 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:27:09,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:27:09,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:27:09,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:27:09,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:27:09,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (1/1) ... [2025-04-13 19:27:09,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:27:09,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:27:09,693 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:27:09,695 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:27:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:27:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:27:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:27:09,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:27:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:27:09,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:27:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:27:09,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:27:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 19:27:09,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 19:27:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:27:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:27:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:27:09,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:27:09,714 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:27:09,823 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:27:09,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:27:10,105 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:27:10,106 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:27:10,106 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:27:10,341 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:27:10,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:27:10 BoogieIcfgContainer [2025-04-13 19:27:10,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:27:10,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:27:10,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:27:10,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:27:10,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:27:09" (1/3) ... [2025-04-13 19:27:10,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e874367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:27:10, skipping insertion in model container [2025-04-13 19:27:10,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:27:09" (2/3) ... [2025-04-13 19:27:10,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e874367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:27:10, skipping insertion in model container [2025-04-13 19:27:10,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:27:10" (3/3) ... [2025-04-13 19:27:10,348 INFO L128 eAbstractionObserver]: Analyzing ICFG mix007.oepc.i [2025-04-13 19:27:10,358 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:27:10,359 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix007.oepc.i that has 5 procedures, 47 locations, 42 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 19:27:10,359 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:27:10,413 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:27:10,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 108 flow [2025-04-13 19:27:10,500 INFO L116 PetriNetUnfolderBase]: 0/42 cut-off events. [2025-04-13 19:27:10,509 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:27:10,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:27:10,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 108 flow [2025-04-13 19:27:10,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 42 transitions, 96 flow [2025-04-13 19:27:10,520 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:27:10,528 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;@3582320a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:27:10,528 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:27:10,533 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:27:10,534 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 19:27:10,534 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:27:10,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:10,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:27:10,534 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:10,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:10,538 INFO L85 PathProgramCache]: Analyzing trace with hash 12684035, now seen corresponding path program 1 times [2025-04-13 19:27:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:10,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503371810] [2025-04-13 19:27:10,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:27:10,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:10,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:27:10,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:27:10,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:27:10,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:10,877 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:27:10,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:10,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503371810] [2025-04-13 19:27:10,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503371810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:10,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:10,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:27:10,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240062407] [2025-04-13 19:27:10,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:10,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:27:10,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:10,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:27:10,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:27:10,900 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2025-04-13 19:27:10,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:27:10,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:10,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2025-04-13 19:27:10,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:27:11,615 INFO L116 PetriNetUnfolderBase]: 2495/3906 cut-off events. [2025-04-13 19:27:11,616 INFO L117 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-04-13 19:27:11,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7482 conditions, 3906 events. 2495/3906 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 24179 event pairs, 1647 based on Foata normal form. 0/3724 useless extension candidates. Maximal degree in co-relation 7470. Up to 2779 conditions per place. [2025-04-13 19:27:11,645 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 37 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2025-04-13 19:27:11,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 221 flow [2025-04-13 19:27:11,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:27:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:27:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-04-13 19:27:11,655 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2025-04-13 19:27:11,656 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 96 flow. Second operand 3 states and 108 transitions. [2025-04-13 19:27:11,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 221 flow [2025-04-13 19:27:11,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:27:11,662 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 92 flow [2025-04-13 19:27:11,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2025-04-13 19:27:11,669 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2025-04-13 19:27:11,669 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 92 flow [2025-04-13 19:27:11,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:27:11,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:11,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:27:11,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:27:11,670 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:11,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:11,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1906904636, now seen corresponding path program 1 times [2025-04-13 19:27:11,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:11,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683129655] [2025-04-13 19:27:11,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:27:11,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:11,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:27:11,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:27:11,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:27:11,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:11,971 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:27:11,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:11,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683129655] [2025-04-13 19:27:11,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683129655] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:11,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:11,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:27:11,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770495431] [2025-04-13 19:27:11,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:11,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:27:11,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:11,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:27:11,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:27:11,991 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2025-04-13 19:27:11,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:27:11,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:11,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2025-04-13 19:27:11,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:27:14,582 INFO L116 PetriNetUnfolderBase]: 21890/31628 cut-off events. [2025-04-13 19:27:14,582 INFO L117 PetriNetUnfolderBase]: For 1529/1529 co-relation queries the response was YES. [2025-04-13 19:27:14,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63298 conditions, 31628 events. 21890/31628 cut-off events. For 1529/1529 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 219301 event pairs, 7226 based on Foata normal form. 1044/32534 useless extension candidates. Maximal degree in co-relation 63288. Up to 17213 conditions per place. [2025-04-13 19:27:14,721 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 47 selfloop transitions, 8 changer transitions 33/99 dead transitions. [2025-04-13 19:27:14,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 99 transitions, 398 flow [2025-04-13 19:27:14,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:27:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:27:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-04-13 19:27:14,723 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.717391304347826 [2025-04-13 19:27:14,723 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 5 states and 165 transitions. [2025-04-13 19:27:14,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 99 transitions, 398 flow [2025-04-13 19:27:14,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:27:14,726 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 168 flow [2025-04-13 19:27:14,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-04-13 19:27:14,727 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2025-04-13 19:27:14,727 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 168 flow [2025-04-13 19:27:14,727 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:27:14,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:14,727 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:27:14,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:27:14,729 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:14,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1414170851, now seen corresponding path program 1 times [2025-04-13 19:27:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:14,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231596583] [2025-04-13 19:27:14,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:27:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:14,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:27:14,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:27:14,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:27:14,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:14,941 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:27:14,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:14,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231596583] [2025-04-13 19:27:14,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231596583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:14,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:14,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:27:14,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653638558] [2025-04-13 19:27:14,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:14,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:27:14,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:14,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:27:14,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:27:14,957 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2025-04-13 19:27:14,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:27:14,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:14,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2025-04-13 19:27:14,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:27:17,320 INFO L116 PetriNetUnfolderBase]: 20172/29432 cut-off events. [2025-04-13 19:27:17,320 INFO L117 PetriNetUnfolderBase]: For 19132/19537 co-relation queries the response was YES. [2025-04-13 19:27:17,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76703 conditions, 29432 events. 20172/29432 cut-off events. For 19132/19537 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 200725 event pairs, 3029 based on Foata normal form. 980/30263 useless extension candidates. Maximal degree in co-relation 76689. Up to 13573 conditions per place. [2025-04-13 19:27:17,487 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 59 selfloop transitions, 9 changer transitions 48/127 dead transitions. [2025-04-13 19:27:17,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 127 transitions, 690 flow [2025-04-13 19:27:17,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:27:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:27:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions. [2025-04-13 19:27:17,489 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6614906832298136 [2025-04-13 19:27:17,489 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 168 flow. Second operand 7 states and 213 transitions. [2025-04-13 19:27:17,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 127 transitions, 690 flow [2025-04-13 19:27:17,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 127 transitions, 636 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 19:27:17,571 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 234 flow [2025-04-13 19:27:17,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2025-04-13 19:27:17,571 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 10 predicate places. [2025-04-13 19:27:17,571 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 234 flow [2025-04-13 19:27:17,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:27:17,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:17,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:27:17,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:27:17,572 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:17,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash -882894451, now seen corresponding path program 1 times [2025-04-13 19:27:17,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:17,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368629137] [2025-04-13 19:27:17,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:27:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:17,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:27:17,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:27:17,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:27:17,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:17,722 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:27:17,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:17,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368629137] [2025-04-13 19:27:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368629137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:17,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:27:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852297806] [2025-04-13 19:27:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:17,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:27:17,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:17,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:27:17,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:27:17,738 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2025-04-13 19:27:17,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:27:17,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:17,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2025-04-13 19:27:17,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:27:19,838 INFO L116 PetriNetUnfolderBase]: 18195/26633 cut-off events. [2025-04-13 19:27:19,839 INFO L117 PetriNetUnfolderBase]: For 36932/37537 co-relation queries the response was YES. [2025-04-13 19:27:19,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74539 conditions, 26633 events. 18195/26633 cut-off events. For 36932/37537 co-relation queries the response was YES. Maximal size of possible extension queue 1106. Compared 181986 event pairs, 3669 based on Foata normal form. 840/27364 useless extension candidates. Maximal degree in co-relation 74519. Up to 10861 conditions per place. [2025-04-13 19:27:19,964 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 65 selfloop transitions, 12 changer transitions 42/130 dead transitions. [2025-04-13 19:27:19,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 130 transitions, 778 flow [2025-04-13 19:27:19,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:27:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:27:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2025-04-13 19:27:19,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-04-13 19:27:19,966 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 234 flow. Second operand 7 states and 210 transitions. [2025-04-13 19:27:19,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 130 transitions, 778 flow [2025-04-13 19:27:20,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 130 transitions, 759 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-13 19:27:20,153 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 344 flow [2025-04-13 19:27:20,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=344, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2025-04-13 19:27:20,154 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2025-04-13 19:27:20,154 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 344 flow [2025-04-13 19:27:20,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:27:20,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:20,154 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:27:20,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:27:20,155 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:20,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1064418717, now seen corresponding path program 1 times [2025-04-13 19:27:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:20,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439587917] [2025-04-13 19:27:20,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:27:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:20,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:27:20,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:27:20,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:27:20,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:20,262 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:27:20,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:20,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439587917] [2025-04-13 19:27:20,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439587917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:20,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:20,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:27:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871853558] [2025-04-13 19:27:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:20,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:27:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:20,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:27:20,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:27:20,267 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-04-13 19:27:20,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 344 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:27:20,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:20,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-04-13 19:27:20,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:27:23,636 INFO L116 PetriNetUnfolderBase]: 29117/42016 cut-off events. [2025-04-13 19:27:23,636 INFO L117 PetriNetUnfolderBase]: For 32258/34419 co-relation queries the response was YES. [2025-04-13 19:27:23,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100958 conditions, 42016 events. 29117/42016 cut-off events. For 32258/34419 co-relation queries the response was YES. Maximal size of possible extension queue 2007. Compared 297410 event pairs, 4528 based on Foata normal form. 1901/42419 useless extension candidates. Maximal degree in co-relation 100933. Up to 21889 conditions per place. [2025-04-13 19:27:23,945 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 59 selfloop transitions, 6 changer transitions 0/94 dead transitions. [2025-04-13 19:27:23,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 94 transitions, 600 flow [2025-04-13 19:27:23,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:27:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:27:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2025-04-13 19:27:23,946 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7010869565217391 [2025-04-13 19:27:23,946 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 344 flow. Second operand 4 states and 129 transitions. [2025-04-13 19:27:23,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 94 transitions, 600 flow [2025-04-13 19:27:24,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 94 transitions, 576 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-13 19:27:24,234 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 366 flow [2025-04-13 19:27:24,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-04-13 19:27:24,235 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2025-04-13 19:27:24,235 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 366 flow [2025-04-13 19:27:24,235 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:27:24,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:24,235 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] [2025-04-13 19:27:24,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:27:24,236 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:24,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:24,236 INFO L85 PathProgramCache]: Analyzing trace with hash 570045424, now seen corresponding path program 1 times [2025-04-13 19:27:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:24,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783466150] [2025-04-13 19:27:24,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:27:24,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:24,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:27:24,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:27:24,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:27:24,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:24,556 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:27:24,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:24,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783466150] [2025-04-13 19:27:24,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783466150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:24,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:24,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:27:24,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532607522] [2025-04-13 19:27:24,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:24,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:27:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:24,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:27:24,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:27:24,570 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-04-13 19:27:24,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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:27:24,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:24,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-04-13 19:27:24,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:27:26,931 INFO L116 PetriNetUnfolderBase]: 24271/35740 cut-off events. [2025-04-13 19:27:26,931 INFO L117 PetriNetUnfolderBase]: For 26890/28375 co-relation queries the response was YES. [2025-04-13 19:27:27,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95382 conditions, 35740 events. 24271/35740 cut-off events. For 26890/28375 co-relation queries the response was YES. Maximal size of possible extension queue 1645. Compared 254044 event pairs, 2762 based on Foata normal form. 1642/36122 useless extension candidates. Maximal degree in co-relation 95357. Up to 12758 conditions per place. [2025-04-13 19:27:27,179 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 77 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2025-04-13 19:27:27,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 116 transitions, 747 flow [2025-04-13 19:27:27,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:27:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:27:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-04-13 19:27:27,181 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7217391304347827 [2025-04-13 19:27:27,181 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 366 flow. Second operand 5 states and 166 transitions. [2025-04-13 19:27:27,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 116 transitions, 747 flow [2025-04-13 19:27:27,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 116 transitions, 732 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-13 19:27:27,199 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 425 flow [2025-04-13 19:27:27,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=425, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2025-04-13 19:27:27,200 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2025-04-13 19:27:27,200 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 425 flow [2025-04-13 19:27:27,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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:27:27,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:27,200 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:27:27,200 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:27:27,200 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:27,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:27,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1865855478, now seen corresponding path program 1 times [2025-04-13 19:27:27,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:27,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766501490] [2025-04-13 19:27:27,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:27:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:27,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 19:27:27,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 19:27:27,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:27:27,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:27,461 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:27:27,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:27,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766501490] [2025-04-13 19:27:27,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766501490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:27,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:27,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:27:27,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731089197] [2025-04-13 19:27:27,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:27,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:27:27,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:27,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:27:27,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:27:27,469 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-04-13 19:27:27,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:27:27,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:27,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-04-13 19:27:27,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:27:29,559 INFO L116 PetriNetUnfolderBase]: 20011/29712 cut-off events. [2025-04-13 19:27:29,560 INFO L117 PetriNetUnfolderBase]: For 42681/43746 co-relation queries the response was YES. [2025-04-13 19:27:29,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88856 conditions, 29712 events. 20011/29712 cut-off events. For 42681/43746 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 209320 event pairs, 2228 based on Foata normal form. 962/29497 useless extension candidates. Maximal degree in co-relation 88830. Up to 10390 conditions per place. [2025-04-13 19:27:29,702 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 91 selfloop transitions, 14 changer transitions 0/134 dead transitions. [2025-04-13 19:27:29,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 134 transitions, 888 flow [2025-04-13 19:27:29,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:27:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:27:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2025-04-13 19:27:29,703 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-04-13 19:27:29,703 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 425 flow. Second operand 6 states and 201 transitions. [2025-04-13 19:27:29,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 134 transitions, 888 flow [2025-04-13 19:27:29,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 134 transitions, 872 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 19:27:29,721 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 495 flow [2025-04-13 19:27:29,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=495, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2025-04-13 19:27:29,721 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 22 predicate places. [2025-04-13 19:27:29,721 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 495 flow [2025-04-13 19:27:29,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:27:29,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:29,722 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] [2025-04-13 19:27:29,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:27:29,722 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:29,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:29,722 INFO L85 PathProgramCache]: Analyzing trace with hash 601286864, now seen corresponding path program 1 times [2025-04-13 19:27:29,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:29,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220640467] [2025-04-13 19:27:29,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:27:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:29,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:27:29,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:27:29,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:27:29,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:30,510 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:27:30,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:30,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220640467] [2025-04-13 19:27:30,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220640467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:30,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:30,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:27:30,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776530036] [2025-04-13 19:27:30,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:30,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:27:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:30,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:27:30,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:27:30,519 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2025-04-13 19:27:30,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 495 flow. Second operand has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 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:27:30,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:30,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2025-04-13 19:27:30,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:27:33,199 INFO L116 PetriNetUnfolderBase]: 18105/31786 cut-off events. [2025-04-13 19:27:33,200 INFO L117 PetriNetUnfolderBase]: For 52278/62463 co-relation queries the response was YES. [2025-04-13 19:27:33,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92632 conditions, 31786 events. 18105/31786 cut-off events. For 52278/62463 co-relation queries the response was YES. Maximal size of possible extension queue 2126. Compared 298230 event pairs, 6815 based on Foata normal form. 869/29463 useless extension candidates. Maximal degree in co-relation 92604. Up to 12510 conditions per place. [2025-04-13 19:27:33,475 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 67 selfloop transitions, 17 changer transitions 10/142 dead transitions. [2025-04-13 19:27:33,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 142 transitions, 947 flow [2025-04-13 19:27:33,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:27:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:27:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 257 transitions. [2025-04-13 19:27:33,477 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6983695652173914 [2025-04-13 19:27:33,477 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 495 flow. Second operand 8 states and 257 transitions. [2025-04-13 19:27:33,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 142 transitions, 947 flow [2025-04-13 19:27:33,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 142 transitions, 916 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-13 19:27:33,863 INFO L231 Difference]: Finished difference. Result has 86 places, 90 transitions, 624 flow [2025-04-13 19:27:33,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=624, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2025-04-13 19:27:33,863 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 31 predicate places. [2025-04-13 19:27:33,863 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 624 flow [2025-04-13 19:27:33,864 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 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:27:33,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:33,864 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] [2025-04-13 19:27:33,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:27:33,864 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:33,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:33,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2035848356, now seen corresponding path program 2 times [2025-04-13 19:27:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:33,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267435830] [2025-04-13 19:27:33,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:27:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:33,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:27:33,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:27:33,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:27:33,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:34,051 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:27:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:34,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267435830] [2025-04-13 19:27:34,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267435830] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:34,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:34,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:27:34,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101618012] [2025-04-13 19:27:34,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:34,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:27:34,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:34,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:27:34,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:27:34,058 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-04-13 19:27:34,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 624 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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:27:34,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:34,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-04-13 19:27:34,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:27:38,025 INFO L116 PetriNetUnfolderBase]: 34570/51173 cut-off events. [2025-04-13 19:27:38,025 INFO L117 PetriNetUnfolderBase]: For 100677/104060 co-relation queries the response was YES. [2025-04-13 19:27:38,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171522 conditions, 51173 events. 34570/51173 cut-off events. For 100677/104060 co-relation queries the response was YES. Maximal size of possible extension queue 2529. Compared 386283 event pairs, 3051 based on Foata normal form. 710/50034 useless extension candidates. Maximal degree in co-relation 171489. Up to 19614 conditions per place. [2025-04-13 19:27:38,359 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 109 selfloop transitions, 18 changer transitions 24/180 dead transitions. [2025-04-13 19:27:38,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 180 transitions, 1411 flow [2025-04-13 19:27:38,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:27:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:27:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2025-04-13 19:27:38,360 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6645962732919255 [2025-04-13 19:27:38,360 INFO L175 Difference]: Start difference. First operand has 86 places, 90 transitions, 624 flow. Second operand 7 states and 214 transitions. [2025-04-13 19:27:38,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 180 transitions, 1411 flow [2025-04-13 19:27:39,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 180 transitions, 1374 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-13 19:27:39,683 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 601 flow [2025-04-13 19:27:39,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=601, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2025-04-13 19:27:39,684 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 33 predicate places. [2025-04-13 19:27:39,684 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 601 flow [2025-04-13 19:27:39,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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:27:39,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:39,684 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, 1, 1, 1, 1] [2025-04-13 19:27:39,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:27:39,685 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:39,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:39,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1784610375, now seen corresponding path program 1 times [2025-04-13 19:27:39,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:39,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92775870] [2025-04-13 19:27:39,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:27:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:39,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:27:39,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:27:39,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:27:39,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:39,872 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:27:39,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:39,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92775870] [2025-04-13 19:27:39,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92775870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:39,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:39,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:27:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757188666] [2025-04-13 19:27:39,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:39,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:27:39,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:39,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:27:39,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:27:39,876 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:27:39,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 601 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:27:39,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:39,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:27:39,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:27:42,570 INFO L116 PetriNetUnfolderBase]: 21148/36426 cut-off events. [2025-04-13 19:27:42,570 INFO L117 PetriNetUnfolderBase]: For 87682/96248 co-relation queries the response was YES. [2025-04-13 19:27:42,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118584 conditions, 36426 events. 21148/36426 cut-off events. For 87682/96248 co-relation queries the response was YES. Maximal size of possible extension queue 2363. Compared 342669 event pairs, 5876 based on Foata normal form. 589/32633 useless extension candidates. Maximal degree in co-relation 118552. Up to 12488 conditions per place. [2025-04-13 19:27:42,862 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 57 selfloop transitions, 4 changer transitions 29/133 dead transitions. [2025-04-13 19:27:42,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 133 transitions, 1032 flow [2025-04-13 19:27:42,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:27:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:27:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-04-13 19:27:42,864 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6782608695652174 [2025-04-13 19:27:42,864 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 601 flow. Second operand 5 states and 156 transitions. [2025-04-13 19:27:42,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 133 transitions, 1032 flow [2025-04-13 19:27:44,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 133 transitions, 957 flow, removed 26 selfloop flow, removed 6 redundant places. [2025-04-13 19:27:44,417 INFO L231 Difference]: Finished difference. Result has 87 places, 82 transitions, 548 flow [2025-04-13 19:27:44,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=548, PETRI_PLACES=87, PETRI_TRANSITIONS=82} [2025-04-13 19:27:44,418 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2025-04-13 19:27:44,418 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 82 transitions, 548 flow [2025-04-13 19:27:44,418 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:27:44,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:44,418 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, 1, 1, 1, 1] [2025-04-13 19:27:44,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:27:44,418 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:44,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2032389689, now seen corresponding path program 2 times [2025-04-13 19:27:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:44,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060253274] [2025-04-13 19:27:44,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:27:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:44,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:27:44,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:27:44,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:27:44,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:45,788 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:27:45,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:45,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060253274] [2025-04-13 19:27:45,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060253274] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:45,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:45,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:27:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190963832] [2025-04-13 19:27:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:45,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:27:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:45,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:27:45,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:27:45,793 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2025-04-13 19:27:45,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 82 transitions, 548 flow. Second operand has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 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:27:45,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:45,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2025-04-13 19:27:45,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:27:50,025 INFO L116 PetriNetUnfolderBase]: 26983/47753 cut-off events. [2025-04-13 19:27:50,025 INFO L117 PetriNetUnfolderBase]: For 82297/92426 co-relation queries the response was YES. [2025-04-13 19:27:50,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139363 conditions, 47753 events. 26983/47753 cut-off events. For 82297/92426 co-relation queries the response was YES. Maximal size of possible extension queue 3569. Compared 487744 event pairs, 8051 based on Foata normal form. 972/42558 useless extension candidates. Maximal degree in co-relation 139331. Up to 13280 conditions per place. [2025-04-13 19:27:50,305 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 68 selfloop transitions, 15 changer transitions 8/140 dead transitions. [2025-04-13 19:27:50,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 140 transitions, 970 flow [2025-04-13 19:27:50,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:27:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:27:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2025-04-13 19:27:50,306 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7018633540372671 [2025-04-13 19:27:50,306 INFO L175 Difference]: Start difference. First operand has 87 places, 82 transitions, 548 flow. Second operand 7 states and 226 transitions. [2025-04-13 19:27:50,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 140 transitions, 970 flow [2025-04-13 19:27:52,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 140 transitions, 965 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 19:27:52,816 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 675 flow [2025-04-13 19:27:52,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=675, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2025-04-13 19:27:52,817 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 38 predicate places. [2025-04-13 19:27:52,817 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 675 flow [2025-04-13 19:27:52,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 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:27:52,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:52,817 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, 1, 1, 1, 1] [2025-04-13 19:27:52,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:27:52,818 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:27:52,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1189175941, now seen corresponding path program 3 times [2025-04-13 19:27:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:52,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336618131] [2025-04-13 19:27:52,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:27:52,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:52,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:27:52,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:27:52,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:27:52,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:27:52,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:27:52,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:27:52,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:27:52,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:27:52,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:27:52,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:27:52,971 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:27:52,971 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 19:27:52,973 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:27:52,973 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 19:27:52,973 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 19:27:52,973 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 19:27:52,973 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 19:27:52,973 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:27:52,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:27:52,973 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:27:53,078 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:27:53,078 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:27:53,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:27:53 BasicIcfg [2025-04-13 19:27:53,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:27:53,086 INFO L158 Benchmark]: Toolchain (without parser) took 43956.40ms. Allocated memory was 125.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 89.5MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2025-04-13 19:27:53,086 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:27:53,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.12ms. Allocated memory is still 125.8MB. Free memory was 89.5MB in the beginning and 62.0MB in the end (delta: 27.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 19:27:53,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.16ms. Allocated memory is still 125.8MB. Free memory was 62.0MB in the beginning and 58.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:27:53,086 INFO L158 Benchmark]: Boogie Preprocessor took 51.31ms. Allocated memory is still 125.8MB. Free memory was 58.9MB in the beginning and 55.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:27:53,088 INFO L158 Benchmark]: RCFGBuilder took 675.35ms. Allocated memory is still 125.8MB. Free memory was 55.8MB in the beginning and 44.1MB in the end (delta: 11.7MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. [2025-04-13 19:27:53,088 INFO L158 Benchmark]: TraceAbstraction took 42742.68ms. Allocated memory was 125.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 43.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2025-04-13 19:27:53,089 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 84.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 440.12ms. Allocated memory is still 125.8MB. Free memory was 89.5MB in the beginning and 62.0MB in the end (delta: 27.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.16ms. Allocated memory is still 125.8MB. Free memory was 62.0MB in the beginning and 58.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.31ms. Allocated memory is still 125.8MB. Free memory was 58.9MB in the beginning and 55.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 675.35ms. Allocated memory is still 125.8MB. Free memory was 55.8MB in the beginning and 44.1MB in the end (delta: 11.7MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. * TraceAbstraction took 42742.68ms. Allocated memory was 125.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 43.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t177; [L872] FCALL, FORK 0 pthread_create(&t177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t177=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t178; [L874] FCALL, FORK 0 pthread_create(&t178, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t177=-3, t178=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t179; [L876] FCALL, FORK 0 pthread_create(&t179, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t177=-3, t178=-2, t179=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t180; [L878] FCALL, FORK 0 pthread_create(&t180, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t177=-3, t178=-2, t179=-1, t180=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 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=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x 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=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L827] 4 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 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=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=1] [L777] 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=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t177=-3, t178=-2, t179=-1, t180=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t177=-3, t178=-2, t179=-1, t180=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t177=-3, t178=-2, t179=-1, t180=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\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=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 874]: 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: 878]: 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: 876]: 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, 82 locations, 77 edges, 7 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: 42.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 772 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 729 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1685 IncrementalHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 39 mSDtfsCounter, 1685 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=675occurred in iteration=11, InterpolantAutomatonStates: 64, 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.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 1629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:27:53,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...