/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/mix013.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:28:10,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:28:10,426 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:28:10,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:28:10,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:28:10,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:28:10,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:28:10,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:28:10,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:28:10,451 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:28:10,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:28:10,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:28:10,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:28:10,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:28:10,451 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:28:10,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:28:10,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:28:10,451 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:28:10,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:28:10,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:28:10,452 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:28:10,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:28:10,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:28:10,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:28:10,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:28:10,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:28:10,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:28:10,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:28:10,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:28:10,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:28:10,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:28:10,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:28:10,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:28:10,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:28:10,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:28:10,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:28:10,454 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:28:10,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:28:10,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:28:10,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:28:10,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:28:10,700 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:28:10,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2025-04-13 19:28:11,938 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af73f7335/d9cb2a84a18c4bceb99ae9bfdc61ce2f/FLAG30a6d5499 [2025-04-13 19:28:12,223 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:28:12,223 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2025-04-13 19:28:12,239 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af73f7335/d9cb2a84a18c4bceb99ae9bfdc61ce2f/FLAG30a6d5499 [2025-04-13 19:28:12,989 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af73f7335/d9cb2a84a18c4bceb99ae9bfdc61ce2f [2025-04-13 19:28:12,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:28:12,994 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:28:12,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:28:12,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:28:12,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:28:12,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:28:12" (1/1) ... [2025-04-13 19:28:12,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@233cab7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:12, skipping insertion in model container [2025-04-13 19:28:12,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:28:12" (1/1) ... [2025-04-13 19:28:13,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:28:13,198 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/mix013.opt.i[944,957] [2025-04-13 19:28:13,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:28:13,385 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:28:13,403 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/mix013.opt.i[944,957] [2025-04-13 19:28:13,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:28:13,477 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:28:13,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13 WrapperNode [2025-04-13 19:28:13,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:28:13,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:28:13,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:28:13,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:28:13,483 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:28:13" (1/1) ... [2025-04-13 19:28:13,502 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:28:13" (1/1) ... [2025-04-13 19:28:13,521 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2025-04-13 19:28:13,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:28:13,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:28:13,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:28:13,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:28:13,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (1/1) ... [2025-04-13 19:28:13,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (1/1) ... [2025-04-13 19:28:13,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (1/1) ... [2025-04-13 19:28:13,549 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:28:13,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (1/1) ... [2025-04-13 19:28:13,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (1/1) ... [2025-04-13 19:28:13,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (1/1) ... [2025-04-13 19:28:13,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (1/1) ... [2025-04-13 19:28:13,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (1/1) ... [2025-04-13 19:28:13,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (1/1) ... [2025-04-13 19:28:13,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (1/1) ... [2025-04-13 19:28:13,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:28:13,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:28:13,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:28:13,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:28:13,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (1/1) ... [2025-04-13 19:28:13,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:28:13,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:28:13,595 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:28:13,597 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:28:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:28:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:28:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:28:13,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:28:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:28:13,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:28:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:28:13,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:28:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 19:28:13,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 19:28:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:28:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:28:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:28:13,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:28:13,614 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:28:13,706 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:28:13,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:28:13,958 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:28:13,958 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:28:13,958 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:28:14,193 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:28:14,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:28:14 BoogieIcfgContainer [2025-04-13 19:28:14,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:28:14,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:28:14,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:28:14,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:28:14,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:28:12" (1/3) ... [2025-04-13 19:28:14,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5951156a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:28:14, skipping insertion in model container [2025-04-13 19:28:14,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:28:13" (2/3) ... [2025-04-13 19:28:14,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5951156a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:28:14, skipping insertion in model container [2025-04-13 19:28:14,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:28:14" (3/3) ... [2025-04-13 19:28:14,201 INFO L128 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2025-04-13 19:28:14,210 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:28:14,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix013.opt.i that has 5 procedures, 47 locations, 42 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 19:28:14,212 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:28:14,259 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:28:14,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 108 flow [2025-04-13 19:28:14,307 INFO L116 PetriNetUnfolderBase]: 0/42 cut-off events. [2025-04-13 19:28:14,310 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:28:14,311 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 92 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:28:14,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 108 flow [2025-04-13 19:28:14,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 42 transitions, 96 flow [2025-04-13 19:28:14,324 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:28:14,332 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;@1ec6d5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:28:14,332 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:28:14,338 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:28:14,338 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-13 19:28:14,338 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:28:14,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:14,339 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:28:14,339 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:14,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:14,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1539088355, now seen corresponding path program 1 times [2025-04-13 19:28:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:14,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648539918] [2025-04-13 19:28:14,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:28:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:14,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:28:14,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:28:14,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:28:14,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:14,744 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:28:14,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:14,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648539918] [2025-04-13 19:28:14,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648539918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:14,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:14,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:28:14,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321982886] [2025-04-13 19:28:14,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:14,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:28:14,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:14,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:28:14,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:28:14,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 46 [2025-04-13 19:28:14,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:28:14,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:14,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 46 [2025-04-13 19:28:14,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:15,080 INFO L116 PetriNetUnfolderBase]: 879/1417 cut-off events. [2025-04-13 19:28:15,080 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:28:15,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 1417 events. 879/1417 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8688 event pairs, 267 based on Foata normal form. 0/1326 useless extension candidates. Maximal degree in co-relation 2725. Up to 1009 conditions per place. [2025-04-13 19:28:15,096 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 26 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2025-04-13 19:28:15,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 172 flow [2025-04-13 19:28:15,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:28:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:28:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-04-13 19:28:15,104 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7463768115942029 [2025-04-13 19:28:15,106 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 96 flow. Second operand 3 states and 103 transitions. [2025-04-13 19:28:15,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 172 flow [2025-04-13 19:28:15,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:28:15,112 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 92 flow [2025-04-13 19:28:15,113 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:28:15,115 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2025-04-13 19:28:15,115 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 92 flow [2025-04-13 19:28:15,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:28:15,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:15,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:28:15,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:28:15,118 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:15,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:15,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1357060736, now seen corresponding path program 1 times [2025-04-13 19:28:15,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:15,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389436082] [2025-04-13 19:28:15,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:28:15,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:15,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:28:15,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:28:15,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:28:15,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:15,347 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:28:15,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:15,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389436082] [2025-04-13 19:28:15,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389436082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:15,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:15,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:28:15,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76444150] [2025-04-13 19:28:15,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:15,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:28:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:15,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:28:15,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:28:15,360 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:28:15,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 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:28:15,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:15,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:28:15,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:16,163 INFO L116 PetriNetUnfolderBase]: 4153/6359 cut-off events. [2025-04-13 19:28:16,163 INFO L117 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-04-13 19:28:16,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12481 conditions, 6359 events. 4153/6359 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 41646 event pairs, 2525 based on Foata normal form. 216/6447 useless extension candidates. Maximal degree in co-relation 12471. Up to 5115 conditions per place. [2025-04-13 19:28:16,201 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 34 selfloop transitions, 5 changer transitions 18/72 dead transitions. [2025-04-13 19:28:16,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 282 flow [2025-04-13 19:28:16,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:28:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:28:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-04-13 19:28:16,203 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6695652173913044 [2025-04-13 19:28:16,203 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 5 states and 154 transitions. [2025-04-13 19:28:16,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 282 flow [2025-04-13 19:28:16,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:28:16,205 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 133 flow [2025-04-13 19:28:16,205 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=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-04-13 19:28:16,205 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 1 predicate places. [2025-04-13 19:28:16,206 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 133 flow [2025-04-13 19:28:16,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 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:28:16,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:16,206 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:28:16,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:28:16,206 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:16,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:16,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1855679799, now seen corresponding path program 1 times [2025-04-13 19:28:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:16,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356802643] [2025-04-13 19:28:16,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:28:16,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:16,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:28:16,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:28:16,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:28:16,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:16,384 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:28:16,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:16,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356802643] [2025-04-13 19:28:16,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356802643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:16,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:16,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:28:16,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583027828] [2025-04-13 19:28:16,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:16,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:28:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:16,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:28:16,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:28:16,397 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:28:16,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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:28:16,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:16,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:28:16,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:17,020 INFO L116 PetriNetUnfolderBase]: 3855/6096 cut-off events. [2025-04-13 19:28:17,020 INFO L117 PetriNetUnfolderBase]: For 3605/3605 co-relation queries the response was YES. [2025-04-13 19:28:17,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15099 conditions, 6096 events. 3855/6096 cut-off events. For 3605/3605 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 41027 event pairs, 1307 based on Foata normal form. 208/6201 useless extension candidates. Maximal degree in co-relation 15086. Up to 4009 conditions per place. [2025-04-13 19:28:17,061 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 42 selfloop transitions, 3 changer transitions 22/82 dead transitions. [2025-04-13 19:28:17,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 389 flow [2025-04-13 19:28:17,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:28:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:28:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-04-13 19:28:17,064 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2025-04-13 19:28:17,064 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 133 flow. Second operand 5 states and 160 transitions. [2025-04-13 19:28:17,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 389 flow [2025-04-13 19:28:17,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 382 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:28:17,088 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 141 flow [2025-04-13 19:28:17,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2025-04-13 19:28:17,089 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2025-04-13 19:28:17,089 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 141 flow [2025-04-13 19:28:17,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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:28:17,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:17,089 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:28:17,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:28:17,089 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:17,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:17,090 INFO L85 PathProgramCache]: Analyzing trace with hash -186197745, now seen corresponding path program 1 times [2025-04-13 19:28:17,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:17,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040106119] [2025-04-13 19:28:17,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:28:17,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:17,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:28:17,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:28:17,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:28:17,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:17,268 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:28:17,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:17,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040106119] [2025-04-13 19:28:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040106119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:17,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:17,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:28:17,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283222138] [2025-04-13 19:28:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:17,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:28:17,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:17,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:28:17,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:28:17,279 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:28:17,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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:28:17,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:17,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:28:17,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:17,799 INFO L116 PetriNetUnfolderBase]: 3438/5162 cut-off events. [2025-04-13 19:28:17,800 INFO L117 PetriNetUnfolderBase]: For 4921/4921 co-relation queries the response was YES. [2025-04-13 19:28:17,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13741 conditions, 5162 events. 3438/5162 cut-off events. For 4921/4921 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 32408 event pairs, 887 based on Foata normal form. 162/5233 useless extension candidates. Maximal degree in co-relation 13725. Up to 3019 conditions per place. [2025-04-13 19:28:17,829 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 36 selfloop transitions, 3 changer transitions 18/72 dead transitions. [2025-04-13 19:28:17,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 350 flow [2025-04-13 19:28:17,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:28:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:28:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2025-04-13 19:28:17,831 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-04-13 19:28:17,831 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 141 flow. Second operand 5 states and 150 transitions. [2025-04-13 19:28:17,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 350 flow [2025-04-13 19:28:17,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 338 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:28:17,843 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 146 flow [2025-04-13 19:28:17,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2025-04-13 19:28:17,844 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2025-04-13 19:28:17,844 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 146 flow [2025-04-13 19:28:17,844 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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:28:17,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:17,844 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:28:17,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:28:17,846 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:17,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1553275559, now seen corresponding path program 1 times [2025-04-13 19:28:17,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:17,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827939128] [2025-04-13 19:28:17,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:28:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:17,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:28:17,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:28:17,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:28:17,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:18,039 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:28:18,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:18,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827939128] [2025-04-13 19:28:18,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827939128] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:18,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:18,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:28:18,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320647828] [2025-04-13 19:28:18,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:18,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:28:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:18,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:28:18,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:28:18,044 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:28:18,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:28:18,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:18,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:28:18,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:18,719 INFO L116 PetriNetUnfolderBase]: 6381/9134 cut-off events. [2025-04-13 19:28:18,719 INFO L117 PetriNetUnfolderBase]: For 6453/6884 co-relation queries the response was YES. [2025-04-13 19:28:18,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22577 conditions, 9134 events. 6381/9134 cut-off events. For 6453/6884 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 57998 event pairs, 1186 based on Foata normal form. 365/9167 useless extension candidates. Maximal degree in co-relation 22560. Up to 4679 conditions per place. [2025-04-13 19:28:18,769 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 49 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2025-04-13 19:28:18,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 340 flow [2025-04-13 19:28:18,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:28:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:28:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-04-13 19:28:18,771 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7119565217391305 [2025-04-13 19:28:18,771 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 146 flow. Second operand 4 states and 131 transitions. [2025-04-13 19:28:18,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 340 flow [2025-04-13 19:28:18,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 326 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:28:18,779 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 182 flow [2025-04-13 19:28:18,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2025-04-13 19:28:18,779 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2025-04-13 19:28:18,779 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 182 flow [2025-04-13 19:28:18,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:28:18,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:18,780 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:28:18,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:28:18,780 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:18,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:18,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1442927341, now seen corresponding path program 1 times [2025-04-13 19:28:18,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:18,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529605659] [2025-04-13 19:28:18,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:28:18,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:18,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:28:18,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:28:18,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:28:18,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:18,961 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:28:18,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:18,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529605659] [2025-04-13 19:28:18,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529605659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:18,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:18,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:28:18,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659430111] [2025-04-13 19:28:18,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:18,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:28:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:18,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:28:18,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:28:18,976 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:28:18,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:28:18,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:18,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:28:18,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:19,833 INFO L116 PetriNetUnfolderBase]: 5891/8592 cut-off events. [2025-04-13 19:28:19,833 INFO L117 PetriNetUnfolderBase]: For 6465/7454 co-relation queries the response was YES. [2025-04-13 19:28:19,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24103 conditions, 8592 events. 5891/8592 cut-off events. For 6465/7454 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 54691 event pairs, 731 based on Foata normal form. 379/8675 useless extension candidates. Maximal degree in co-relation 24086. Up to 3718 conditions per place. [2025-04-13 19:28:19,892 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 63 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2025-04-13 19:28:19,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 466 flow [2025-04-13 19:28:19,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:28:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:28:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-04-13 19:28:19,893 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7304347826086957 [2025-04-13 19:28:19,893 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 182 flow. Second operand 5 states and 168 transitions. [2025-04-13 19:28:19,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 466 flow [2025-04-13 19:28:19,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 463 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:28:19,896 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 247 flow [2025-04-13 19:28:19,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-04-13 19:28:19,897 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2025-04-13 19:28:19,897 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 247 flow [2025-04-13 19:28:19,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:28:19,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:19,897 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:28:19,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:28:19,897 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:19,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2140872833, now seen corresponding path program 1 times [2025-04-13 19:28:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:19,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304113585] [2025-04-13 19:28:19,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:28:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:19,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 19:28:19,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 19:28:19,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:28:19,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:20,129 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:28:20,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:20,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304113585] [2025-04-13 19:28:20,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304113585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:20,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:20,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:28:20,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432216631] [2025-04-13 19:28:20,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:20,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:28:20,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:20,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:28:20,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:28:20,142 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:28:20,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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:28:20,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:20,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:28:20,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:20,732 INFO L116 PetriNetUnfolderBase]: 4923/7288 cut-off events. [2025-04-13 19:28:20,732 INFO L117 PetriNetUnfolderBase]: For 11675/13666 co-relation queries the response was YES. [2025-04-13 19:28:20,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23486 conditions, 7288 events. 4923/7288 cut-off events. For 11675/13666 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 45329 event pairs, 535 based on Foata normal form. 309/7317 useless extension candidates. Maximal degree in co-relation 23466. Up to 2446 conditions per place. [2025-04-13 19:28:20,774 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 75 selfloop transitions, 14 changer transitions 0/106 dead transitions. [2025-04-13 19:28:20,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 106 transitions, 614 flow [2025-04-13 19:28:20,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:28:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:28:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-04-13 19:28:20,775 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7355072463768116 [2025-04-13 19:28:20,775 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 247 flow. Second operand 6 states and 203 transitions. [2025-04-13 19:28:20,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 106 transitions, 614 flow [2025-04-13 19:28:20,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 598 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 19:28:20,781 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 317 flow [2025-04-13 19:28:20,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2025-04-13 19:28:20,782 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2025-04-13 19:28:20,782 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 317 flow [2025-04-13 19:28:20,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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:28:20,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:20,782 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:28:20,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:28:20,782 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:20,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:20,782 INFO L85 PathProgramCache]: Analyzing trace with hash -73273213, now seen corresponding path program 1 times [2025-04-13 19:28:20,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:20,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550627872] [2025-04-13 19:28:20,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:28:20,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:20,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:28:20,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:28:20,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:28:20,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:21,008 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:28:21,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:21,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550627872] [2025-04-13 19:28:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550627872] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:21,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:21,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:28:21,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112330029] [2025-04-13 19:28:21,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:21,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:28:21,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:21,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:28:21,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:28:21,013 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2025-04-13 19:28:21,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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:28:21,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:21,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2025-04-13 19:28:21,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:21,627 INFO L116 PetriNetUnfolderBase]: 4591/8119 cut-off events. [2025-04-13 19:28:21,627 INFO L117 PetriNetUnfolderBase]: For 13246/15050 co-relation queries the response was YES. [2025-04-13 19:28:21,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23436 conditions, 8119 events. 4591/8119 cut-off events. For 13246/15050 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 63695 event pairs, 1728 based on Foata normal form. 233/7546 useless extension candidates. Maximal degree in co-relation 23414. Up to 3421 conditions per place. [2025-04-13 19:28:21,686 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 54 selfloop transitions, 2 changer transitions 7/97 dead transitions. [2025-04-13 19:28:21,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 97 transitions, 587 flow [2025-04-13 19:28:21,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:28:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:28:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-04-13 19:28:21,687 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.717391304347826 [2025-04-13 19:28:21,687 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 317 flow. Second operand 5 states and 165 transitions. [2025-04-13 19:28:21,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 97 transitions, 587 flow [2025-04-13 19:28:21,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 97 transitions, 556 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-13 19:28:21,710 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 301 flow [2025-04-13 19:28:21,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2025-04-13 19:28:21,711 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2025-04-13 19:28:21,711 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 301 flow [2025-04-13 19:28:21,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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:28:21,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:21,711 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:28:21,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:28:21,712 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:21,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:21,712 INFO L85 PathProgramCache]: Analyzing trace with hash -824536565, now seen corresponding path program 2 times [2025-04-13 19:28:21,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:21,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294911967] [2025-04-13 19:28:21,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:28:21,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:21,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:28:21,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:28:21,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:28:21,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:21,900 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:28:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:21,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294911967] [2025-04-13 19:28:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294911967] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:21,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:21,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:28:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512513226] [2025-04-13 19:28:21,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:21,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:28:21,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:21,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:28:21,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:28:21,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2025-04-13 19:28:21,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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:28:21,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:21,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2025-04-13 19:28:21,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:22,917 INFO L116 PetriNetUnfolderBase]: 7760/14013 cut-off events. [2025-04-13 19:28:22,918 INFO L117 PetriNetUnfolderBase]: For 18070/19973 co-relation queries the response was YES. [2025-04-13 19:28:22,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39104 conditions, 14013 events. 7760/14013 cut-off events. For 18070/19973 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 123001 event pairs, 2964 based on Foata normal form. 352/12966 useless extension candidates. Maximal degree in co-relation 39080. Up to 4737 conditions per place. [2025-04-13 19:28:22,982 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 51 selfloop transitions, 2 changer transitions 14/101 dead transitions. [2025-04-13 19:28:22,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 101 transitions, 594 flow [2025-04-13 19:28:22,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:28:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:28:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2025-04-13 19:28:22,983 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7260869565217392 [2025-04-13 19:28:22,983 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 301 flow. Second operand 5 states and 167 transitions. [2025-04-13 19:28:22,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 101 transitions, 594 flow [2025-04-13 19:28:23,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 101 transitions, 589 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 19:28:23,026 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 319 flow [2025-04-13 19:28:23,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2025-04-13 19:28:23,026 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 22 predicate places. [2025-04-13 19:28:23,027 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 319 flow [2025-04-13 19:28:23,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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:28:23,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:23,028 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:28:23,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:28:23,028 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:23,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:23,028 INFO L85 PathProgramCache]: Analyzing trace with hash 233483561, now seen corresponding path program 3 times [2025-04-13 19:28:23,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:23,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71371462] [2025-04-13 19:28:23,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:28:23,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:23,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:28:23,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:28:23,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:28:23,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:23,182 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:28:23,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:23,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71371462] [2025-04-13 19:28:23,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71371462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:23,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:23,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:28:23,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513336316] [2025-04-13 19:28:23,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:23,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:28:23,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:23,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:28:23,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:28:23,187 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:28:23,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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:28:23,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:23,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:28:23,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:24,444 INFO L116 PetriNetUnfolderBase]: 12542/18382 cut-off events. [2025-04-13 19:28:24,444 INFO L117 PetriNetUnfolderBase]: For 33910/38800 co-relation queries the response was YES. [2025-04-13 19:28:24,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60157 conditions, 18382 events. 12542/18382 cut-off events. For 33910/38800 co-relation queries the response was YES. Maximal size of possible extension queue 1374. Compared 131179 event pairs, 993 based on Foata normal form. 591/18185 useless extension candidates. Maximal degree in co-relation 60131. Up to 6612 conditions per place. [2025-04-13 19:28:24,514 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 54 selfloop transitions, 18 changer transitions 15/106 dead transitions. [2025-04-13 19:28:24,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 106 transitions, 628 flow [2025-04-13 19:28:24,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:28:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:28:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions. [2025-04-13 19:28:24,516 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6832298136645962 [2025-04-13 19:28:24,516 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 319 flow. Second operand 7 states and 220 transitions. [2025-04-13 19:28:24,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 106 transitions, 628 flow [2025-04-13 19:28:24,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 106 transitions, 608 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-13 19:28:24,625 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 355 flow [2025-04-13 19:28:24,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=355, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2025-04-13 19:28:24,625 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 25 predicate places. [2025-04-13 19:28:24,625 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 355 flow [2025-04-13 19:28:24,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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:28:24,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:24,626 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:28:24,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:28:24,626 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:24,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash -498223762, now seen corresponding path program 1 times [2025-04-13 19:28:24,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:24,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181458889] [2025-04-13 19:28:24,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:28:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:24,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:28:24,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:28:24,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:28:24,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:24,796 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:28:24,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:24,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181458889] [2025-04-13 19:28:24,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181458889] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:24,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:24,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:28:24,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668798050] [2025-04-13 19:28:24,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:24,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:28:24,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:24,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:28:24,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:28:24,802 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2025-04-13 19:28:24,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 355 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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:28:24,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:24,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2025-04-13 19:28:24,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:26,799 INFO L116 PetriNetUnfolderBase]: 14493/25399 cut-off events. [2025-04-13 19:28:26,799 INFO L117 PetriNetUnfolderBase]: For 60791/65068 co-relation queries the response was YES. [2025-04-13 19:28:27,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76361 conditions, 25399 events. 14493/25399 cut-off events. For 60791/65068 co-relation queries the response was YES. Maximal size of possible extension queue 1920. Compared 237328 event pairs, 2221 based on Foata normal form. 266/23194 useless extension candidates. Maximal degree in co-relation 76335. Up to 10922 conditions per place. [2025-04-13 19:28:27,306 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 40 selfloop transitions, 7 changer transitions 33/109 dead transitions. [2025-04-13 19:28:27,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 109 transitions, 699 flow [2025-04-13 19:28:27,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:28:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:28:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-04-13 19:28:27,308 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6557971014492754 [2025-04-13 19:28:27,308 INFO L175 Difference]: Start difference. First operand has 80 places, 61 transitions, 355 flow. Second operand 6 states and 181 transitions. [2025-04-13 19:28:27,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 109 transitions, 699 flow [2025-04-13 19:28:27,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 109 transitions, 602 flow, removed 28 selfloop flow, removed 8 redundant places. [2025-04-13 19:28:27,742 INFO L231 Difference]: Finished difference. Result has 80 places, 59 transitions, 288 flow [2025-04-13 19:28:27,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=80, PETRI_TRANSITIONS=59} [2025-04-13 19:28:27,743 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 25 predicate places. [2025-04-13 19:28:27,743 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 59 transitions, 288 flow [2025-04-13 19:28:27,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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:28:27,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:27,743 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:28:27,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:28:27,743 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:27,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:27,744 INFO L85 PathProgramCache]: Analyzing trace with hash 184714682, now seen corresponding path program 2 times [2025-04-13 19:28:27,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:27,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3196461] [2025-04-13 19:28:27,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:28:27,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:27,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:28:27,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:28:27,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:28:27,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:27,904 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:28:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:27,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3196461] [2025-04-13 19:28:27,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3196461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:27,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:27,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:28:27,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546074195] [2025-04-13 19:28:27,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:27,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:28:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:27,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:28:27,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:28:27,908 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2025-04-13 19:28:27,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 59 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:28:27,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:27,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2025-04-13 19:28:27,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:28,350 INFO L116 PetriNetUnfolderBase]: 3537/6853 cut-off events. [2025-04-13 19:28:28,350 INFO L117 PetriNetUnfolderBase]: For 7064/7731 co-relation queries the response was YES. [2025-04-13 19:28:28,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17526 conditions, 6853 events. 3537/6853 cut-off events. For 7064/7731 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 58338 event pairs, 807 based on Foata normal form. 70/6026 useless extension candidates. Maximal degree in co-relation 17500. Up to 2250 conditions per place. [2025-04-13 19:28:28,383 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 27 selfloop transitions, 1 changer transitions 20/80 dead transitions. [2025-04-13 19:28:28,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 446 flow [2025-04-13 19:28:28,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:28:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:28:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-04-13 19:28:28,384 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6652173913043479 [2025-04-13 19:28:28,384 INFO L175 Difference]: Start difference. First operand has 80 places, 59 transitions, 288 flow. Second operand 5 states and 153 transitions. [2025-04-13 19:28:28,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 446 flow [2025-04-13 19:28:28,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 433 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-13 19:28:28,408 INFO L231 Difference]: Finished difference. Result has 79 places, 55 transitions, 259 flow [2025-04-13 19:28:28,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=79, PETRI_TRANSITIONS=55} [2025-04-13 19:28:28,409 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 24 predicate places. [2025-04-13 19:28:28,409 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 55 transitions, 259 flow [2025-04-13 19:28:28,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:28:28,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:28,409 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:28:28,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:28:28,409 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:28,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:28,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1508460948, now seen corresponding path program 3 times [2025-04-13 19:28:28,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:28,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590453285] [2025-04-13 19:28:28,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:28:28,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:28,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:28:28,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:28:28,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:28:28,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:28:29,756 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:28:29,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:28:29,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590453285] [2025-04-13 19:28:29,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590453285] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:28:29,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:28:29,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:28:29,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435779917] [2025-04-13 19:28:29,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:28:29,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:28:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:28:29,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:28:29,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:28:29,763 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 46 [2025-04-13 19:28:29,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 55 transitions, 259 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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:28:29,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:28:29,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 46 [2025-04-13 19:28:29,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:28:30,132 INFO L116 PetriNetUnfolderBase]: 1948/3855 cut-off events. [2025-04-13 19:28:30,132 INFO L117 PetriNetUnfolderBase]: For 3515/3970 co-relation queries the response was YES. [2025-04-13 19:28:30,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9677 conditions, 3855 events. 1948/3855 cut-off events. For 3515/3970 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 30294 event pairs, 514 based on Foata normal form. 40/3346 useless extension candidates. Maximal degree in co-relation 9652. Up to 1342 conditions per place. [2025-04-13 19:28:30,159 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 31 selfloop transitions, 6 changer transitions 12/82 dead transitions. [2025-04-13 19:28:30,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 429 flow [2025-04-13 19:28:30,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:28:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:28:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 256 transitions. [2025-04-13 19:28:30,161 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6183574879227053 [2025-04-13 19:28:30,161 INFO L175 Difference]: Start difference. First operand has 79 places, 55 transitions, 259 flow. Second operand 9 states and 256 transitions. [2025-04-13 19:28:30,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 429 flow [2025-04-13 19:28:30,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 82 transitions, 416 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-13 19:28:30,171 INFO L231 Difference]: Finished difference. Result has 84 places, 56 transitions, 278 flow [2025-04-13 19:28:30,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=84, PETRI_TRANSITIONS=56} [2025-04-13 19:28:30,173 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 29 predicate places. [2025-04-13 19:28:30,173 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 56 transitions, 278 flow [2025-04-13 19:28:30,174 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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:28:30,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:28:30,174 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:28:30,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:28:30,174 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:28:30,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:28:30,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1015331198, now seen corresponding path program 4 times [2025-04-13 19:28:30,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:28:30,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167014671] [2025-04-13 19:28:30,174 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:28:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:28:30,185 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 19:28:30,228 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:28:30,228 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:28:30,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:28:30,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:28:30,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:28:30,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:28:30,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:28:30,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:28:30,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:28:30,304 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:28:30,305 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 19:28:30,306 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:28:30,306 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 19:28:30,306 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 19:28:30,306 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 19:28:30,307 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 19:28:30,307 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:28:30,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:28:30,307 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:28:30,404 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:28:30,405 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:28:30,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:28:30 BasicIcfg [2025-04-13 19:28:30,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:28:30,415 INFO L158 Benchmark]: Toolchain (without parser) took 17420.30ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 98.2MB in the beginning and 505.4MB in the end (delta: -407.3MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-13 19:28:30,416 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:28:30,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.38ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 70.6MB in the end (delta: 26.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 19:28:30,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.97ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 67.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:28:30,417 INFO L158 Benchmark]: Boogie Preprocessor took 38.00ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 63.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:28:30,417 INFO L158 Benchmark]: RCFGBuilder took 632.66ms. Allocated memory is still 142.6MB. Free memory was 63.8MB in the beginning and 54.7MB in the end (delta: 9.1MB). Peak memory consumption was 48.8MB. Max. memory is 8.0GB. [2025-04-13 19:28:30,418 INFO L158 Benchmark]: TraceAbstraction took 16217.85ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 54.0MB in the beginning and 505.4MB in the end (delta: -451.4MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-04-13 19:28:30,418 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.16ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 483.38ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 70.6MB in the end (delta: 26.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.97ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 67.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 38.00ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 63.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 632.66ms. Allocated memory is still 142.6MB. Free memory was 63.8MB in the beginning and 54.7MB in the end (delta: 9.1MB). Peak memory consumption was 48.8MB. Max. memory is 8.0GB. * TraceAbstraction took 16217.85ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 54.0MB in the beginning and 505.4MB in the end (delta: -451.4MB). Peak memory consumption was 1.1GB. 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_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-3, t326=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-3, t326=-2, t327=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-3, t326=-2, t327=-1, t328=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EBX = 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L782] 2 __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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L810] 3 __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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-3, t326=-2, t327=-1, t328=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-3, t326=-2, t327=-1, t328=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-3, t326=-2, t327=-1, t328=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 16.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 631 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 595 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1447 IncrementalHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 39 mSDtfsCounter, 1447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=10, InterpolantAutomatonStates: 70, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 2358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:28:30,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...