/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:06:46,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:06:46,974 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-14 00:06:46,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:06:46,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:06:47,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:06:47,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:06:47,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:06:47,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:06:47,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:06:47,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:06:47,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:06:47,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:06:47,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:06:47,032 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:06:47,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:06:47,033 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:06:47,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:06:47,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:06:47,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:06:47,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:06:47,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:06:47,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:06:47,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:06:47,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:06:47,038 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:06:47,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:06:47,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:06:47,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:06:47,476 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:06:47,477 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:06:47,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2025-04-14 00:06:49,518 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2e18bbe/9d5ec2775dd64d488b251be94afee0f1/FLAG619a741c5 [2025-04-14 00:06:50,060 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:06:50,060 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2025-04-14 00:06:50,081 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2e18bbe/9d5ec2775dd64d488b251be94afee0f1/FLAG619a741c5 [2025-04-14 00:06:50,568 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2e18bbe/9d5ec2775dd64d488b251be94afee0f1 [2025-04-14 00:06:50,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:06:50,573 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:06:50,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:06:50,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:06:50,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:06:50,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:06:50" (1/1) ... [2025-04-14 00:06:50,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e69e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:50, skipping insertion in model container [2025-04-14 00:06:50,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:06:50" (1/1) ... [2025-04-14 00:06:50,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:06:50,942 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/mix055.opt.i[944,957] [2025-04-14 00:06:51,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:06:51,236 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:06:51,273 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/mix055.opt.i[944,957] [2025-04-14 00:06:51,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:06:51,456 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:06:51,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51 WrapperNode [2025-04-14 00:06:51,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:06:51,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:06:51,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:06:51,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:06:51,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,534 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2025-04-14 00:06:51,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:06:51,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:06:51,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:06:51,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:06:51,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,618 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-14 00:06:51,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,633 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:06:51,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:06:51,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:06:51,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:06:51,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (1/1) ... [2025-04-14 00:06:51,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:06:51,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:06:51,729 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-14 00:06:51,742 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-14 00:06:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:06:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:06:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:06:51,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:06:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:06:51,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:06:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:06:51,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:06:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-14 00:06:51,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-14 00:06:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:06:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:06:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:06:51,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:06:51,784 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:06:51,984 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:06:51,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:06:52,482 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:06:52,483 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:06:52,483 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:06:52,958 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:06:52,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:06:52 BoogieIcfgContainer [2025-04-14 00:06:52,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:06:52,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:06:52,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:06:52,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:06:52,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:06:50" (1/3) ... [2025-04-14 00:06:52,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654e4ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:06:52, skipping insertion in model container [2025-04-14 00:06:52,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:06:51" (2/3) ... [2025-04-14 00:06:52,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654e4ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:06:52, skipping insertion in model container [2025-04-14 00:06:52,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:06:52" (3/3) ... [2025-04-14 00:06:52,976 INFO L128 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2025-04-14 00:06:53,009 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:06:53,016 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix055.opt.i that has 5 procedures, 45 locations, 40 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:06:53,016 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:06:53,094 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:06:53,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 44 transitions, 104 flow [2025-04-14 00:06:53,202 INFO L116 PetriNetUnfolderBase]: 0/40 cut-off events. [2025-04-14 00:06:53,209 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:06:53,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:06:53,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 44 transitions, 104 flow [2025-04-14 00:06:53,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 40 transitions, 92 flow [2025-04-14 00:06:53,237 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:06:53,275 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;@5fd511b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:06:53,275 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-14 00:06:53,292 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:06:53,293 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-14 00:06:53,293 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:06:53,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:06:53,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:06:53,295 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-14 00:06:53,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:06:53,306 INFO L85 PathProgramCache]: Analyzing trace with hash 591826607, now seen corresponding path program 1 times [2025-04-14 00:06:53,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:06:53,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253647281] [2025-04-14 00:06:53,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:06:53,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:06:53,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 00:06:53,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 00:06:53,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:06:53,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:06:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:06:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:06:54,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253647281] [2025-04-14 00:06:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253647281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:06:54,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:06:54,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:06:54,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250418721] [2025-04-14 00:06:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:06:54,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:06:54,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:06:54,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:06:54,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:06:54,313 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:06:54,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-14 00:06:54,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:06:54,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:06:54,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:07:00,692 INFO L116 PetriNetUnfolderBase]: 34475/45407 cut-off events. [2025-04-14 00:07:00,692 INFO L117 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-04-14 00:07:00,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91291 conditions, 45407 events. 34475/45407 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 1422. Compared 249267 event pairs, 5315 based on Foata normal form. 0/44040 useless extension candidates. Maximal degree in co-relation 91279. Up to 37801 conditions per place. [2025-04-14 00:07:01,300 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 53 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2025-04-14 00:07:01,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 248 flow [2025-04-14 00:07:01,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:07:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:07:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-04-14 00:07:01,312 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-04-14 00:07:01,313 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 3 states and 82 transitions. [2025-04-14 00:07:01,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 248 flow [2025-04-14 00:07:01,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 244 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:07:01,326 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 88 flow [2025-04-14 00:07:01,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-04-14 00:07:01,337 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-04-14 00:07:01,338 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 88 flow [2025-04-14 00:07:01,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-14 00:07:01,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:07:01,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:07:01,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:07:01,338 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-14 00:07:01,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:07:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1167378329, now seen corresponding path program 1 times [2025-04-14 00:07:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:07:01,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142502706] [2025-04-14 00:07:01,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:07:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:07:01,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:07:01,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:07:01,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:07:01,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:07:02,641 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-14 00:07:02,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:07:02,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142502706] [2025-04-14 00:07:02,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142502706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:07:02,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:07:02,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:07:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475713091] [2025-04-14 00:07:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:07:02,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:07:02,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:07:02,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:07:02,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:07:02,643 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:07:02,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-14 00:07:02,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:07:02,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:07:02,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:07:06,460 INFO L116 PetriNetUnfolderBase]: 32723/43511 cut-off events. [2025-04-14 00:07:06,460 INFO L117 PetriNetUnfolderBase]: For 1584/1584 co-relation queries the response was YES. [2025-04-14 00:07:06,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89081 conditions, 43511 events. 32723/43511 cut-off events. For 1584/1584 co-relation queries the response was YES. Maximal size of possible extension queue 1418. Compared 243035 event pairs, 7739 based on Foata normal form. 1296/44754 useless extension candidates. Maximal degree in co-relation 89071. Up to 37333 conditions per place. [2025-04-14 00:07:06,729 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 50 selfloop transitions, 3 changer transitions 34/91 dead transitions. [2025-04-14 00:07:06,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 91 transitions, 376 flow [2025-04-14 00:07:06,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:07:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:07:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-04-14 00:07:06,737 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5863636363636363 [2025-04-14 00:07:06,737 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 5 states and 129 transitions. [2025-04-14 00:07:06,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 91 transitions, 376 flow [2025-04-14 00:07:06,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 91 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:07:06,757 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 111 flow [2025-04-14 00:07:06,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-04-14 00:07:06,759 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2025-04-14 00:07:06,759 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 111 flow [2025-04-14 00:07:06,760 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-14 00:07:06,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:07:06,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:07:06,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:07:06,760 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-14 00:07:06,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:07:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash -862548759, now seen corresponding path program 1 times [2025-04-14 00:07:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:07:06,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140324730] [2025-04-14 00:07:06,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:07:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:07:06,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:07:06,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:07:06,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:07:06,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:07:07,760 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-14 00:07:07,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:07:07,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140324730] [2025-04-14 00:07:07,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140324730] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:07:07,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:07:07,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:07:07,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523211754] [2025-04-14 00:07:07,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:07:07,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:07:07,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:07:07,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:07:07,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:07:07,761 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:07:07,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:07:07,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:07:07,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:07:07,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:07:13,705 INFO L116 PetriNetUnfolderBase]: 51990/69272 cut-off events. [2025-04-14 00:07:13,706 INFO L117 PetriNetUnfolderBase]: For 21227/21234 co-relation queries the response was YES. [2025-04-14 00:07:13,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155380 conditions, 69272 events. 51990/69272 cut-off events. For 21227/21234 co-relation queries the response was YES. Maximal size of possible extension queue 2069. Compared 423873 event pairs, 2423 based on Foata normal form. 2029/71295 useless extension candidates. Maximal degree in co-relation 155367. Up to 41939 conditions per place. [2025-04-14 00:07:14,326 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 78 selfloop transitions, 12 changer transitions 53/147 dead transitions. [2025-04-14 00:07:14,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 147 transitions, 681 flow [2025-04-14 00:07:14,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:07:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:07:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2025-04-14 00:07:14,331 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-04-14 00:07:14,331 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 111 flow. Second operand 7 states and 196 transitions. [2025-04-14 00:07:14,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 147 transitions, 681 flow [2025-04-14 00:07:15,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 147 transitions, 670 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:07:15,128 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 205 flow [2025-04-14 00:07:15,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-04-14 00:07:15,129 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2025-04-14 00:07:15,129 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 205 flow [2025-04-14 00:07:15,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:07:15,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:07:15,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:07:15,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:07:15,132 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-14 00:07:15,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:07:15,140 INFO L85 PathProgramCache]: Analyzing trace with hash -221609046, now seen corresponding path program 1 times [2025-04-14 00:07:15,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:07:15,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695753798] [2025-04-14 00:07:15,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:07:15,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:07:15,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:07:15,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:07:15,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:07:15,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:07:16,294 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-14 00:07:16,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:07:16,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695753798] [2025-04-14 00:07:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695753798] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:07:16,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:07:16,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:07:16,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97179111] [2025-04-14 00:07:16,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:07:16,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:07:16,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:07:16,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:07:16,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:07:16,300 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:07:16,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-14 00:07:16,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:07:16,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:07:16,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:07:21,958 INFO L116 PetriNetUnfolderBase]: 50891/68041 cut-off events. [2025-04-14 00:07:21,958 INFO L117 PetriNetUnfolderBase]: For 65482/65572 co-relation queries the response was YES. [2025-04-14 00:07:22,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192675 conditions, 68041 events. 50891/68041 cut-off events. For 65482/65572 co-relation queries the response was YES. Maximal size of possible extension queue 1993. Compared 399391 event pairs, 13293 based on Foata normal form. 1662/69652 useless extension candidates. Maximal degree in co-relation 192657. Up to 55731 conditions per place. [2025-04-14 00:07:22,461 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 86 selfloop transitions, 9 changer transitions 41/140 dead transitions. [2025-04-14 00:07:22,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 140 transitions, 813 flow [2025-04-14 00:07:22,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:07:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:07:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-04-14 00:07:22,464 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5871212121212122 [2025-04-14 00:07:22,465 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 205 flow. Second operand 6 states and 155 transitions. [2025-04-14 00:07:22,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 140 transitions, 813 flow [2025-04-14 00:07:24,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 140 transitions, 809 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:07:24,252 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 301 flow [2025-04-14 00:07:24,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2025-04-14 00:07:24,252 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-04-14 00:07:24,253 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 301 flow [2025-04-14 00:07:24,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-14 00:07:24,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:07:24,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:07:24,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:07:24,253 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-14 00:07:24,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:07:24,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1368004958, now seen corresponding path program 2 times [2025-04-14 00:07:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:07:24,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171032141] [2025-04-14 00:07:24,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:07:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:07:24,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:07:24,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:07:24,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:07:24,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:07:25,088 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-14 00:07:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:07:25,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171032141] [2025-04-14 00:07:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171032141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:07:25,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:07:25,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:07:25,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791129913] [2025-04-14 00:07:25,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:07:25,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:07:25,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:07:25,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:07:25,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:07:25,091 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:07:25,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-14 00:07:25,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:07:25,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:07:25,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:07:29,970 INFO L116 PetriNetUnfolderBase]: 53994/72158 cut-off events. [2025-04-14 00:07:29,970 INFO L117 PetriNetUnfolderBase]: For 101756/101917 co-relation queries the response was YES. [2025-04-14 00:07:30,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222108 conditions, 72158 events. 53994/72158 cut-off events. For 101756/101917 co-relation queries the response was YES. Maximal size of possible extension queue 2101. Compared 427985 event pairs, 7227 based on Foata normal form. 2036/74143 useless extension candidates. Maximal degree in co-relation 222086. Up to 42385 conditions per place. [2025-04-14 00:07:30,572 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 79 selfloop transitions, 24 changer transitions 45/152 dead transitions. [2025-04-14 00:07:30,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 152 transitions, 975 flow [2025-04-14 00:07:30,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:07:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:07:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2025-04-14 00:07:30,573 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2025-04-14 00:07:30,573 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 301 flow. Second operand 6 states and 171 transitions. [2025-04-14 00:07:30,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 152 transitions, 975 flow [2025-04-14 00:07:31,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 152 transitions, 955 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-14 00:07:31,706 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 483 flow [2025-04-14 00:07:31,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=483, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2025-04-14 00:07:31,708 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2025-04-14 00:07:31,708 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 483 flow [2025-04-14 00:07:31,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-14 00:07:31,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:07:31,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:07:31,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:07:31,709 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-14 00:07:31,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:07:31,710 INFO L85 PathProgramCache]: Analyzing trace with hash 789236916, now seen corresponding path program 3 times [2025-04-14 00:07:31,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:07:31,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863726440] [2025-04-14 00:07:31,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:07:31,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:07:31,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:07:31,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:07:31,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:07:31,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:07:31,850 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-14 00:07:31,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:07:31,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863726440] [2025-04-14 00:07:31,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863726440] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:07:31,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:07:31,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:07:31,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489483361] [2025-04-14 00:07:31,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:07:31,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:07:31,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:07:31,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:07:31,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:07:31,852 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:07:31,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 483 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-14 00:07:31,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:07:31,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:07:31,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:07:35,951 INFO L116 PetriNetUnfolderBase]: 46355/62471 cut-off events. [2025-04-14 00:07:35,952 INFO L117 PetriNetUnfolderBase]: For 175306/175489 co-relation queries the response was YES. [2025-04-14 00:07:36,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219945 conditions, 62471 events. 46355/62471 cut-off events. For 175306/175489 co-relation queries the response was YES. Maximal size of possible extension queue 1884. Compared 376510 event pairs, 5608 based on Foata normal form. 2308/64745 useless extension candidates. Maximal degree in co-relation 219919. Up to 34167 conditions per place. [2025-04-14 00:07:36,438 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 146 selfloop transitions, 6 changer transitions 1/157 dead transitions. [2025-04-14 00:07:36,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 157 transitions, 1443 flow [2025-04-14 00:07:36,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:07:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:07:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-04-14 00:07:36,443 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-04-14 00:07:36,443 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 483 flow. Second operand 4 states and 112 transitions. [2025-04-14 00:07:36,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 157 transitions, 1443 flow [2025-04-14 00:07:36,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 157 transitions, 1424 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 00:07:36,838 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 512 flow [2025-04-14 00:07:36,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=512, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2025-04-14 00:07:36,839 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2025-04-14 00:07:36,839 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 512 flow [2025-04-14 00:07:36,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-14 00:07:36,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:07:36,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:07:36,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:07:36,839 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-14 00:07:36,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:07:36,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1677775408, now seen corresponding path program 1 times [2025-04-14 00:07:36,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:07:36,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731040970] [2025-04-14 00:07:36,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:07:36,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:07:36,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:07:36,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:07:36,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:07:36,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:07:37,212 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-14 00:07:37,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:07:37,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731040970] [2025-04-14 00:07:37,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731040970] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:07:37,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:07:37,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:07:37,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539418412] [2025-04-14 00:07:37,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:07:37,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:07:37,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:07:37,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:07:37,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:07:37,213 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:07:37,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 512 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-14 00:07:37,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:07:37,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:07:37,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:07:41,044 INFO L116 PetriNetUnfolderBase]: 41769/56279 cut-off events. [2025-04-14 00:07:41,044 INFO L117 PetriNetUnfolderBase]: For 138113/138342 co-relation queries the response was YES. [2025-04-14 00:07:41,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212048 conditions, 56279 events. 41769/56279 cut-off events. For 138113/138342 co-relation queries the response was YES. Maximal size of possible extension queue 1588. Compared 329027 event pairs, 7411 based on Foata normal form. 1094/57322 useless extension candidates. Maximal degree in co-relation 212019. Up to 45307 conditions per place. [2025-04-14 00:07:41,482 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 113 selfloop transitions, 15 changer transitions 52/184 dead transitions. [2025-04-14 00:07:41,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 184 transitions, 1573 flow [2025-04-14 00:07:41,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:07:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:07:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2025-04-14 00:07:41,484 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5616883116883117 [2025-04-14 00:07:41,484 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 512 flow. Second operand 7 states and 173 transitions. [2025-04-14 00:07:41,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 184 transitions, 1573 flow [2025-04-14 00:07:41,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 184 transitions, 1527 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-04-14 00:07:41,609 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 617 flow [2025-04-14 00:07:41,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=617, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2025-04-14 00:07:41,611 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2025-04-14 00:07:41,611 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 617 flow [2025-04-14 00:07:41,612 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-14 00:07:41,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:07:41,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:07:41,612 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:07:41,612 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-14 00:07:41,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:07:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash 371044788, now seen corresponding path program 1 times [2025-04-14 00:07:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:07:41,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265619102] [2025-04-14 00:07:41,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:07:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:07:41,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:07:41,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:07:41,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:07:41,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:07:41,749 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-14 00:07:41,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:07:41,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265619102] [2025-04-14 00:07:41,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265619102] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:07:41,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:07:41,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:07:41,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388018888] [2025-04-14 00:07:41,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:07:41,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:07:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:07:41,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:07:41,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:07:41,750 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:07:41,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 617 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-14 00:07:41,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:07:41,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:07:41,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:07:44,556 INFO L116 PetriNetUnfolderBase]: 30965/42263 cut-off events. [2025-04-14 00:07:44,556 INFO L117 PetriNetUnfolderBase]: For 142830/143076 co-relation queries the response was YES. [2025-04-14 00:07:44,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157440 conditions, 42263 events. 30965/42263 cut-off events. For 142830/143076 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 245469 event pairs, 2873 based on Foata normal form. 1895/44124 useless extension candidates. Maximal degree in co-relation 157407. Up to 15225 conditions per place. [2025-04-14 00:07:44,909 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 198 selfloop transitions, 10 changer transitions 1/213 dead transitions. [2025-04-14 00:07:44,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 213 transitions, 2200 flow [2025-04-14 00:07:44,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:07:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:07:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-04-14 00:07:44,910 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2025-04-14 00:07:44,910 INFO L175 Difference]: Start difference. First operand has 80 places, 78 transitions, 617 flow. Second operand 5 states and 145 transitions. [2025-04-14 00:07:44,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 213 transitions, 2200 flow [2025-04-14 00:07:44,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 213 transitions, 2132 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-04-14 00:07:44,984 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 641 flow [2025-04-14 00:07:44,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=641, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2025-04-14 00:07:44,985 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2025-04-14 00:07:44,985 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 641 flow [2025-04-14 00:07:44,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-14 00:07:44,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:07:44,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:07:44,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:07:44,985 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-14 00:07:44,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:07:44,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2434679, now seen corresponding path program 1 times [2025-04-14 00:07:44,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:07:44,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90560515] [2025-04-14 00:07:44,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:07:44,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:07:44,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:07:45,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:07:45,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:07:45,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:07:45,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-14 00:07:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:07:45,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90560515] [2025-04-14 00:07:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90560515] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:07:45,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:07:45,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:07:45,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979250165] [2025-04-14 00:07:45,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:07:45,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:07:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:07:45,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:07:45,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:07:45,385 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:07:45,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 641 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-14 00:07:45,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:07:45,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:07:45,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:07:48,732 INFO L116 PetriNetUnfolderBase]: 35853/48991 cut-off events. [2025-04-14 00:07:48,733 INFO L117 PetriNetUnfolderBase]: For 152473/152531 co-relation queries the response was YES. [2025-04-14 00:07:49,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191614 conditions, 48991 events. 35853/48991 cut-off events. For 152473/152531 co-relation queries the response was YES. Maximal size of possible extension queue 1203. Compared 287603 event pairs, 11467 based on Foata normal form. 600/49585 useless extension candidates. Maximal degree in co-relation 191581. Up to 26496 conditions per place. [2025-04-14 00:07:49,136 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 112 selfloop transitions, 14 changer transitions 50/180 dead transitions. [2025-04-14 00:07:49,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 180 transitions, 1671 flow [2025-04-14 00:07:49,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:07:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:07:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2025-04-14 00:07:49,137 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2025-04-14 00:07:49,138 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 641 flow. Second operand 6 states and 159 transitions. [2025-04-14 00:07:49,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 180 transitions, 1671 flow [2025-04-14 00:07:49,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 180 transitions, 1619 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-14 00:07:49,426 INFO L231 Difference]: Finished difference. Result has 84 places, 84 transitions, 714 flow [2025-04-14 00:07:49,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=714, PETRI_PLACES=84, PETRI_TRANSITIONS=84} [2025-04-14 00:07:49,427 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2025-04-14 00:07:49,427 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 84 transitions, 714 flow [2025-04-14 00:07:49,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-14 00:07:49,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:07:49,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:07:49,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:07:49,428 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-14 00:07:49,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:07:49,428 INFO L85 PathProgramCache]: Analyzing trace with hash -828724301, now seen corresponding path program 1 times [2025-04-14 00:07:49,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:07:49,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072735960] [2025-04-14 00:07:49,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:07:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:07:49,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:07:49,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:07:49,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:07:49,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:07:49,685 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-14 00:07:49,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:07:49,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072735960] [2025-04-14 00:07:49,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072735960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:07:49,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:07:49,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:07:49,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283353655] [2025-04-14 00:07:49,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:07:49,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:07:49,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:07:49,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:07:49,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:07:49,687 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:07:49,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 84 transitions, 714 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-14 00:07:49,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:07:49,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:07:49,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:07:52,654 INFO L116 PetriNetUnfolderBase]: 24981/34443 cut-off events. [2025-04-14 00:07:52,654 INFO L117 PetriNetUnfolderBase]: For 117940/118104 co-relation queries the response was YES. [2025-04-14 00:07:52,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127129 conditions, 34443 events. 24981/34443 cut-off events. For 117940/118104 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 199358 event pairs, 2389 based on Foata normal form. 1355/35764 useless extension candidates. Maximal degree in co-relation 127093. Up to 11260 conditions per place. [2025-04-14 00:07:52,907 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 183 selfloop transitions, 14 changer transitions 21/222 dead transitions. [2025-04-14 00:07:52,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 222 transitions, 2289 flow [2025-04-14 00:07:52,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:07:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:07:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2025-04-14 00:07:52,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-14 00:07:52,909 INFO L175 Difference]: Start difference. First operand has 84 places, 84 transitions, 714 flow. Second operand 6 states and 176 transitions. [2025-04-14 00:07:52,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 222 transitions, 2289 flow [2025-04-14 00:07:53,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 222 transitions, 2237 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-04-14 00:07:53,013 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 706 flow [2025-04-14 00:07:53,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=706, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2025-04-14 00:07:53,014 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2025-04-14 00:07:53,014 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 706 flow [2025-04-14 00:07:53,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-14 00:07:53,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:07:53,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:07:53,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:07:53,015 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-14 00:07:53,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:07:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1212610459, now seen corresponding path program 1 times [2025-04-14 00:07:53,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:07:53,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421262322] [2025-04-14 00:07:53,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:07:53,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:07:53,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:07:53,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:07:53,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:07:53,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:07:53,288 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-14 00:07:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:07:53,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421262322] [2025-04-14 00:07:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421262322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:07:53,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:07:53,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:07:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668589652] [2025-04-14 00:07:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:07:53,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:07:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:07:53,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:07:53,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:07:53,291 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:07:53,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 706 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-14 00:07:53,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:07:53,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:07:53,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:07:57,033 INFO L116 PetriNetUnfolderBase]: 32581/45124 cut-off events. [2025-04-14 00:07:57,033 INFO L117 PetriNetUnfolderBase]: For 147680/147710 co-relation queries the response was YES. [2025-04-14 00:07:57,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175277 conditions, 45124 events. 32581/45124 cut-off events. For 147680/147710 co-relation queries the response was YES. Maximal size of possible extension queue 1322. Compared 269388 event pairs, 7688 based on Foata normal form. 150/45265 useless extension candidates. Maximal degree in co-relation 175242. Up to 25541 conditions per place. [2025-04-14 00:07:57,316 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 129 selfloop transitions, 2 changer transitions 58/193 dead transitions. [2025-04-14 00:07:57,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 193 transitions, 1960 flow [2025-04-14 00:07:57,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:07:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:07:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2025-04-14 00:07:57,318 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6409090909090909 [2025-04-14 00:07:57,318 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 706 flow. Second operand 5 states and 141 transitions. [2025-04-14 00:07:57,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 193 transitions, 1960 flow [2025-04-14 00:07:58,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 193 transitions, 1844 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-04-14 00:07:58,236 INFO L231 Difference]: Finished difference. Result has 86 places, 83 transitions, 679 flow [2025-04-14 00:07:58,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=86, PETRI_TRANSITIONS=83} [2025-04-14 00:07:58,237 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2025-04-14 00:07:58,237 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 679 flow [2025-04-14 00:07:58,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-14 00:07:58,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:07:58,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:07:58,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:07:58,237 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-14 00:07:58,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:07:58,238 INFO L85 PathProgramCache]: Analyzing trace with hash -111920189, now seen corresponding path program 2 times [2025-04-14 00:07:58,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:07:58,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120291330] [2025-04-14 00:07:58,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:07:58,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:07:58,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:07:58,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:07:58,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:07:58,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:07:58,449 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-14 00:07:58,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:07:58,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120291330] [2025-04-14 00:07:58,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120291330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:07:58,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:07:58,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:07:58,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398054480] [2025-04-14 00:07:58,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:07:58,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:07:58,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:07:58,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:07:58,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:07:58,450 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:07:58,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 679 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:07:58,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:07:58,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:07:58,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:08:01,186 INFO L116 PetriNetUnfolderBase]: 27513/38335 cut-off events. [2025-04-14 00:08:01,187 INFO L117 PetriNetUnfolderBase]: For 131527/131655 co-relation queries the response was YES. [2025-04-14 00:08:01,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138601 conditions, 38335 events. 27513/38335 cut-off events. For 131527/131655 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 234215 event pairs, 2473 based on Foata normal form. 759/39060 useless extension candidates. Maximal degree in co-relation 138565. Up to 12200 conditions per place. [2025-04-14 00:08:01,444 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 104 selfloop transitions, 18 changer transitions 73/199 dead transitions. [2025-04-14 00:08:01,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 199 transitions, 2011 flow [2025-04-14 00:08:01,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:08:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:08:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2025-04-14 00:08:01,447 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5616883116883117 [2025-04-14 00:08:01,447 INFO L175 Difference]: Start difference. First operand has 86 places, 83 transitions, 679 flow. Second operand 7 states and 173 transitions. [2025-04-14 00:08:01,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 199 transitions, 2011 flow [2025-04-14 00:08:03,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 199 transitions, 1891 flow, removed 44 selfloop flow, removed 5 redundant places. [2025-04-14 00:08:03,017 INFO L231 Difference]: Finished difference. Result has 88 places, 62 transitions, 447 flow [2025-04-14 00:08:03,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=88, PETRI_TRANSITIONS=62} [2025-04-14 00:08:03,017 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2025-04-14 00:08:03,017 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 62 transitions, 447 flow [2025-04-14 00:08:03,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:08:03,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:08:03,018 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] [2025-04-14 00:08:03,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:08:03,018 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-14 00:08:03,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:08:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1983137843, now seen corresponding path program 1 times [2025-04-14 00:08:03,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:08:03,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278254337] [2025-04-14 00:08:03,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:08:03,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:08:03,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 00:08:03,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:08:03,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:08:03,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:08:04,048 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-14 00:08:04,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:08:04,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278254337] [2025-04-14 00:08:04,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278254337] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:08:04,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:08:04,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:08:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202212259] [2025-04-14 00:08:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:08:04,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:08:04,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:08:04,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:08:04,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:08:04,049 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:08:04,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 62 transitions, 447 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-14 00:08:04,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:08:04,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:08:04,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:08:05,057 INFO L116 PetriNetUnfolderBase]: 6891/9687 cut-off events. [2025-04-14 00:08:05,057 INFO L117 PetriNetUnfolderBase]: For 25691/25691 co-relation queries the response was YES. [2025-04-14 00:08:05,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35680 conditions, 9687 events. 6891/9687 cut-off events. For 25691/25691 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 47812 event pairs, 819 based on Foata normal form. 16/9701 useless extension candidates. Maximal degree in co-relation 35645. Up to 4620 conditions per place. [2025-04-14 00:08:05,129 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 68 selfloop transitions, 6 changer transitions 78/156 dead transitions. [2025-04-14 00:08:05,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 156 transitions, 1332 flow [2025-04-14 00:08:05,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:08:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:08:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2025-04-14 00:08:05,130 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5194805194805194 [2025-04-14 00:08:05,131 INFO L175 Difference]: Start difference. First operand has 88 places, 62 transitions, 447 flow. Second operand 7 states and 160 transitions. [2025-04-14 00:08:05,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 156 transitions, 1332 flow [2025-04-14 00:08:05,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 156 transitions, 958 flow, removed 66 selfloop flow, removed 18 redundant places. [2025-04-14 00:08:05,230 INFO L231 Difference]: Finished difference. Result has 78 places, 54 transitions, 243 flow [2025-04-14 00:08:05,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=78, PETRI_TRANSITIONS=54} [2025-04-14 00:08:05,232 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2025-04-14 00:08:05,232 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 54 transitions, 243 flow [2025-04-14 00:08:05,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-14 00:08:05,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:08:05,232 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] [2025-04-14 00:08:05,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:08:05,233 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-14 00:08:05,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:08:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash 75104081, now seen corresponding path program 2 times [2025-04-14 00:08:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:08:05,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904125280] [2025-04-14 00:08:05,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:08:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:08:05,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-04-14 00:08:05,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:08:05,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:08:05,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:08:06,158 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-14 00:08:06,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:08:06,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904125280] [2025-04-14 00:08:06,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904125280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:08:06,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:08:06,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:08:06,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891174487] [2025-04-14 00:08:06,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:08:06,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:08:06,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:08:06,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:08:06,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:08:06,160 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-04-14 00:08:06,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 54 transitions, 243 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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-14 00:08:06,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:08:06,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-04-14 00:08:06,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:08:06,980 INFO L116 PetriNetUnfolderBase]: 4457/6397 cut-off events. [2025-04-14 00:08:06,980 INFO L117 PetriNetUnfolderBase]: For 4314/4314 co-relation queries the response was YES. [2025-04-14 00:08:07,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17074 conditions, 6397 events. 4457/6397 cut-off events. For 4314/4314 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 31514 event pairs, 659 based on Foata normal form. 16/6411 useless extension candidates. Maximal degree in co-relation 17059. Up to 3236 conditions per place. [2025-04-14 00:08:07,010 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 76 selfloop transitions, 6 changer transitions 37/123 dead transitions. [2025-04-14 00:08:07,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 123 transitions, 743 flow [2025-04-14 00:08:07,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:08:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:08:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2025-04-14 00:08:07,011 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42613636363636365 [2025-04-14 00:08:07,011 INFO L175 Difference]: Start difference. First operand has 78 places, 54 transitions, 243 flow. Second operand 8 states and 150 transitions. [2025-04-14 00:08:07,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 123 transitions, 743 flow [2025-04-14 00:08:07,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 123 transitions, 710 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-04-14 00:08:07,015 INFO L231 Difference]: Finished difference. Result has 77 places, 52 transitions, 226 flow [2025-04-14 00:08:07,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=226, PETRI_PLACES=77, PETRI_TRANSITIONS=52} [2025-04-14 00:08:07,016 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2025-04-14 00:08:07,016 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 52 transitions, 226 flow [2025-04-14 00:08:07,016 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 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-14 00:08:07,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:08:07,017 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] [2025-04-14 00:08:07,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:08:07,017 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:08:07,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:08:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash 340586675, now seen corresponding path program 3 times [2025-04-14 00:08:07,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:08:07,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081464630] [2025-04-14 00:08:07,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:08:07,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:08:07,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-04-14 00:08:07,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:08:07,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:08:07,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:08:07,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:08:07,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 00:08:07,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:08:07,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:08:07,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:08:07,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:08:07,248 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:08:07,253 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-14 00:08:07,258 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-14 00:08:07,259 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-14 00:08:07,259 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-14 00:08:07,259 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-14 00:08:07,259 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-14 00:08:07,259 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-14 00:08:07,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:08:07,260 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:08:07,438 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:08:07,445 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:08:07,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:08:07 BasicIcfg [2025-04-14 00:08:07,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:08:07,454 INFO L158 Benchmark]: Toolchain (without parser) took 76881.85ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 98.5MB in the beginning and 997.7MB in the end (delta: -899.3MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-04-14 00:08:07,454 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:08:07,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 880.00ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 71.5MB in the end (delta: 26.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 00:08:07,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.19ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:08:07,455 INFO L158 Benchmark]: Boogie Preprocessor took 120.94ms. Allocated memory is still 142.6MB. Free memory was 68.8MB in the beginning and 66.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:08:07,455 INFO L158 Benchmark]: IcfgBuilder took 1294.88ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 67.2MB in the end (delta: -2.0MB). Peak memory consumption was 49.0MB. Max. memory is 8.0GB. [2025-04-14 00:08:07,455 INFO L158 Benchmark]: TraceAbstraction took 74487.82ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 66.5MB in the beginning and 997.7MB in the end (delta: -931.3MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2025-04-14 00:08:07,463 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.18ms. Allocated memory is still 167.8MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 880.00ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 71.5MB in the end (delta: 26.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.19ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 120.94ms. Allocated memory is still 142.6MB. Free memory was 68.8MB in the beginning and 66.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1294.88ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 67.2MB in the end (delta: -2.0MB). Peak memory consumption was 49.0MB. Max. memory is 8.0GB. * TraceAbstraction took 74487.82ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 66.5MB in the beginning and 997.7MB in the end (delta: -931.3MB). Peak memory consumption was 1.0GB. 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1461=-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] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1461=-1, t1462=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] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((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_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1461=-1, t1462=0, t1463=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] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((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_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1461=-1, t1462=0, t1463=1, t1464=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] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 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_p1_EAX=0, __unbuffered_p3_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = 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_p1_EAX=0, __unbuffered_p3_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L814] 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) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 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 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 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_p1_EAX=0, __unbuffered_p3_EAX=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=0, x=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L821] 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_p1_EAX=0, __unbuffered_p3_EAX=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=0, x=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L756] 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_p1_EAX=0, __unbuffered_p3_EAX=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=0, x=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L771] 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_p1_EAX=0, __unbuffered_p3_EAX=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=0, x=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L791] 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_p1_EAX=0, __unbuffered_p3_EAX=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=0, x=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L845] 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_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461=-1, t1462=0, t1463=1, t1464=2, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 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) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 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 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 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_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461=-1, t1462=0, t1463=1, t1464=2, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461=-1, t1462=0, t1463=1, t1464=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L871] 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_p1_EAX=0, __unbuffered_p3_EAX=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=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 837]: 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: 839]: 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: 843]: 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: 841]: 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, 78 locations, 73 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: 74.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 64.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1119 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1119 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2798 IncrementalHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 0 mSDtfsCounter, 2798 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=714occurred in iteration=9, InterpolantAutomatonStates: 82, 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.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 2458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-14 00:08:07,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...