/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/weaver/chl-time-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:43:20,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:43:20,589 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:43:20,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:43:20,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:43:20,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:43:20,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:43:20,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:43:20,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:43:20,625 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:43:20,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:43:20,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:43:20,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:43:20,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:43:20,625 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:43:20,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:43:20,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:43:20,626 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:43:20,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:43:20,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:43:20,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:43:20,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:43:20,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:43:20,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:43:20,626 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:43:20,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:43:20,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:43:20,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:43:20,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:43:20,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:43:20,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:43:20,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:43:20,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:43:20,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:43:20,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:43:20,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:43:20,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:43:20,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:43:20,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:43:20,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:43:20,629 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:43:20,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:43:20,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:43:20,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:43:20,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:43:20,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:43:20,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:43:20,630 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:43:20,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:43:20,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:43:20,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:43:20,893 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:43:20,893 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:43:20,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-time-subst.wvr.c [2025-04-14 00:43:22,198 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1394a873b/5d642692a5294e7a9960f61a7d0712ee/FLAG0b680ff8a [2025-04-14 00:43:22,515 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:43:22,517 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-subst.wvr.c [2025-04-14 00:43:22,524 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1394a873b/5d642692a5294e7a9960f61a7d0712ee/FLAG0b680ff8a [2025-04-14 00:43:23,247 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1394a873b/5d642692a5294e7a9960f61a7d0712ee [2025-04-14 00:43:23,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:43:23,252 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:43:23,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:43:23,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:43:23,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:43:23,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b8c3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23, skipping insertion in model container [2025-04-14 00:43:23,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:43:23,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-subst.wvr.c[2918,2931] [2025-04-14 00:43:23,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:43:23,434 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:43:23,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-subst.wvr.c[2918,2931] [2025-04-14 00:43:23,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:43:23,468 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:43:23,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23 WrapperNode [2025-04-14 00:43:23,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:43:23,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:43:23,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:43:23,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:43:23,474 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:43:23" (1/1) ... [2025-04-14 00:43:23,479 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:43:23" (1/1) ... [2025-04-14 00:43:23,498 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 11, calls inlined = 21, statements flattened = 207 [2025-04-14 00:43:23,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:43:23,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:43:23,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:43:23,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:43:23,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,528 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:43:23,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:43:23,541 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:43:23,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:43:23,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:43:23,541 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23" (1/1) ... [2025-04-14 00:43:23,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:43:23,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:43:23,566 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:43:23,568 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:43:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:43:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:43:23,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:43:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:43:23,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:43:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:43:23,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:43:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:43:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:43:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:43:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:43:23,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:43:23,585 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:43:23,679 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:43:23,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:43:24,017 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:43:24,017 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:43:24,017 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:43:24,318 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:43:24,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:43:24 BoogieIcfgContainer [2025-04-14 00:43:24,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:43:24,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:43:24,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:43:24,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:43:24,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:43:23" (1/3) ... [2025-04-14 00:43:24,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b06113b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:43:24, skipping insertion in model container [2025-04-14 00:43:24,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:23" (2/3) ... [2025-04-14 00:43:24,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b06113b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:43:24, skipping insertion in model container [2025-04-14 00:43:24,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:43:24" (3/3) ... [2025-04-14 00:43:24,327 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-time-subst.wvr.c [2025-04-14 00:43:24,336 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:43:24,338 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-time-subst.wvr.c that has 4 procedures, 25 locations, 21 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:43:24,338 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:43:24,383 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:43:24,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 69 flow [2025-04-14 00:43:24,458 INFO L116 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-04-14 00:43:24,459 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:43:24,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-14 00:43:24,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 24 transitions, 69 flow [2025-04-14 00:43:24,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 20 transitions, 58 flow [2025-04-14 00:43:24,473 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:43:24,484 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;@53438fee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:43:24,484 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:43:24,496 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:43:24,496 INFO L116 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-04-14 00:43:24,496 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:43:24,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:24,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:24,497 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:43:24,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash 592118065, now seen corresponding path program 1 times [2025-04-14 00:43:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:24,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182544035] [2025-04-14 00:43:24,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:43:24,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:24,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:43:24,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:43:24,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:43:24,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:25,927 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:43:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:25,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182544035] [2025-04-14 00:43:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182544035] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:25,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:25,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:43:25,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368503171] [2025-04-14 00:43:25,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:25,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:43:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:25,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:43:25,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:43:25,957 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-14 00:43:25,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:25,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:25,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-14 00:43:25,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:26,334 INFO L116 PetriNetUnfolderBase]: 178/335 cut-off events. [2025-04-14 00:43:26,334 INFO L117 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-04-14 00:43:26,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 335 events. 178/335 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1313 event pairs, 46 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 575. Up to 110 conditions per place. [2025-04-14 00:43:26,338 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 30 selfloop transitions, 2 changer transitions 8/43 dead transitions. [2025-04-14 00:43:26,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 43 transitions, 208 flow [2025-04-14 00:43:26,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:43:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:43:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-14 00:43:26,348 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2025-04-14 00:43:26,350 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 58 flow. Second operand 5 states and 71 transitions. [2025-04-14 00:43:26,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 43 transitions, 208 flow [2025-04-14 00:43:26,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:43:26,358 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 61 flow [2025-04-14 00:43:26,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=61, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2025-04-14 00:43:26,363 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-04-14 00:43:26,363 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 61 flow [2025-04-14 00:43:26,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:26,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:26,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:26,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:43:26,364 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:43:26,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:26,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2011892065, now seen corresponding path program 2 times [2025-04-14 00:43:26,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:26,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528423953] [2025-04-14 00:43:26,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:43:26,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:26,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:43:26,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:43:26,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:43:26,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:27,231 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:43:27,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:27,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528423953] [2025-04-14 00:43:27,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528423953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:27,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:43:27,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278474127] [2025-04-14 00:43:27,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:27,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:43:27,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:27,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:43:27,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:43:27,233 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-14 00:43:27,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 61 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:27,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:27,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-14 00:43:27,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:27,504 INFO L116 PetriNetUnfolderBase]: 194/365 cut-off events. [2025-04-14 00:43:27,504 INFO L117 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-04-14 00:43:27,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 365 events. 194/365 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1572 event pairs, 24 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 839. Up to 151 conditions per place. [2025-04-14 00:43:27,507 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 32 selfloop transitions, 2 changer transitions 12/49 dead transitions. [2025-04-14 00:43:27,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 49 transitions, 232 flow [2025-04-14 00:43:27,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:43:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:43:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-14 00:43:27,508 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-14 00:43:27,508 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 61 flow. Second operand 5 states and 75 transitions. [2025-04-14 00:43:27,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 49 transitions, 232 flow [2025-04-14 00:43:27,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 49 transitions, 225 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:43:27,509 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 71 flow [2025-04-14 00:43:27,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2025-04-14 00:43:27,510 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2025-04-14 00:43:27,510 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 71 flow [2025-04-14 00:43:27,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:27,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:27,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:27,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:43:27,510 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:43:27,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash -29287541, now seen corresponding path program 3 times [2025-04-14 00:43:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:27,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802770476] [2025-04-14 00:43:27,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:43:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:27,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:43:27,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:43:27,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:43:27,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:28,174 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:43:28,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:28,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802770476] [2025-04-14 00:43:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802770476] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:28,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:28,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:43:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710345386] [2025-04-14 00:43:28,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:28,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:43:28,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:28,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:43:28,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:43:28,175 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-14 00:43:28,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:28,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:28,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-14 00:43:28,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:28,407 INFO L116 PetriNetUnfolderBase]: 153/299 cut-off events. [2025-04-14 00:43:28,407 INFO L117 PetriNetUnfolderBase]: For 315/315 co-relation queries the response was YES. [2025-04-14 00:43:28,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 299 events. 153/299 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1151 event pairs, 35 based on Foata normal form. 1/300 useless extension candidates. Maximal degree in co-relation 745. Up to 109 conditions per place. [2025-04-14 00:43:28,411 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 31 selfloop transitions, 3 changer transitions 8/45 dead transitions. [2025-04-14 00:43:28,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 227 flow [2025-04-14 00:43:28,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:43:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:43:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-04-14 00:43:28,413 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-04-14 00:43:28,413 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 71 flow. Second operand 5 states and 72 transitions. [2025-04-14 00:43:28,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 227 flow [2025-04-14 00:43:28,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 208 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-14 00:43:28,415 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 82 flow [2025-04-14 00:43:28,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2025-04-14 00:43:28,416 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-04-14 00:43:28,416 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 82 flow [2025-04-14 00:43:28,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:28,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:28,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:28,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:43:28,417 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:43:28,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash -379363887, now seen corresponding path program 4 times [2025-04-14 00:43:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:28,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145739435] [2025-04-14 00:43:28,417 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:43:28,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:28,430 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:43:28,444 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:43:28,444 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:43:28,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:29,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:43:29,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:29,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145739435] [2025-04-14 00:43:29,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145739435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:29,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:29,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:43:29,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411970125] [2025-04-14 00:43:29,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:29,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:43:29,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:29,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:43:29,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:43:29,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-14 00:43:29,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:29,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:29,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-14 00:43:29,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:29,269 INFO L116 PetriNetUnfolderBase]: 160/314 cut-off events. [2025-04-14 00:43:29,270 INFO L117 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2025-04-14 00:43:29,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 314 events. 160/314 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1274 event pairs, 28 based on Foata normal form. 1/314 useless extension candidates. Maximal degree in co-relation 840. Up to 137 conditions per place. [2025-04-14 00:43:29,273 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 30 selfloop transitions, 2 changer transitions 12/47 dead transitions. [2025-04-14 00:43:29,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 249 flow [2025-04-14 00:43:29,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:43:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:43:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-04-14 00:43:29,276 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2025-04-14 00:43:29,276 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 82 flow. Second operand 5 states and 73 transitions. [2025-04-14 00:43:29,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 249 flow [2025-04-14 00:43:29,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 242 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:43:29,277 INFO L231 Difference]: Finished difference. Result has 41 places, 22 transitions, 91 flow [2025-04-14 00:43:29,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=41, PETRI_TRANSITIONS=22} [2025-04-14 00:43:29,278 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2025-04-14 00:43:29,278 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 22 transitions, 91 flow [2025-04-14 00:43:29,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:29,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:29,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:29,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:43:29,280 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:43:29,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash 493864533, now seen corresponding path program 5 times [2025-04-14 00:43:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:29,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757292192] [2025-04-14 00:43:29,280 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:43:29,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:29,289 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:43:29,308 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:43:29,308 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:43:29,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:29,659 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:43:29,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:29,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757292192] [2025-04-14 00:43:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757292192] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:29,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:29,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:43:29,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517824649] [2025-04-14 00:43:29,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:29,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:43:29,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:29,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:43:29,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:43:29,660 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-14 00:43:29,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 22 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:29,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:29,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-14 00:43:29,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:29,790 INFO L116 PetriNetUnfolderBase]: 111/225 cut-off events. [2025-04-14 00:43:29,790 INFO L117 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-04-14 00:43:29,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 225 events. 111/225 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 801 event pairs, 21 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 642. Up to 69 conditions per place. [2025-04-14 00:43:29,794 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 20 selfloop transitions, 1 changer transitions 19/43 dead transitions. [2025-04-14 00:43:29,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 228 flow [2025-04-14 00:43:29,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:43:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:43:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-04-14 00:43:29,795 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-14 00:43:29,796 INFO L175 Difference]: Start difference. First operand has 41 places, 22 transitions, 91 flow. Second operand 5 states and 70 transitions. [2025-04-14 00:43:29,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 228 flow [2025-04-14 00:43:29,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 216 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:43:29,798 INFO L231 Difference]: Finished difference. Result has 42 places, 20 transitions, 71 flow [2025-04-14 00:43:29,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=42, PETRI_TRANSITIONS=20} [2025-04-14 00:43:29,798 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-04-14 00:43:29,798 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 20 transitions, 71 flow [2025-04-14 00:43:29,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:29,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:29,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:29,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:43:29,799 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:43:29,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash -835641301, now seen corresponding path program 6 times [2025-04-14 00:43:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:29,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668278500] [2025-04-14 00:43:29,802 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:43:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:29,811 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:43:29,824 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:43:29,824 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:43:29,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:30,286 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:43:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:30,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668278500] [2025-04-14 00:43:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668278500] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:30,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:43:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368886351] [2025-04-14 00:43:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:30,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:43:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:30,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:43:30,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:43:30,287 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-14 00:43:30,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 20 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:30,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:30,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-14 00:43:30,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:30,451 INFO L116 PetriNetUnfolderBase]: 52/115 cut-off events. [2025-04-14 00:43:30,451 INFO L117 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-04-14 00:43:30,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 115 events. 52/115 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 288 event pairs, 10 based on Foata normal form. 1/116 useless extension candidates. Maximal degree in co-relation 327. Up to 54 conditions per place. [2025-04-14 00:43:30,451 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2025-04-14 00:43:30,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 147 flow [2025-04-14 00:43:30,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:43:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:43:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-04-14 00:43:30,452 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-04-14 00:43:30,452 INFO L175 Difference]: Start difference. First operand has 42 places, 20 transitions, 71 flow. Second operand 5 states and 57 transitions. [2025-04-14 00:43:30,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 147 flow [2025-04-14 00:43:30,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 133 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-14 00:43:30,453 INFO L231 Difference]: Finished difference. Result has 36 places, 0 transitions, 0 flow [2025-04-14 00:43:30,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=36, PETRI_TRANSITIONS=0} [2025-04-14 00:43:30,453 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-04-14 00:43:30,454 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 0 transitions, 0 flow [2025-04-14 00:43:30,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:43:30,456 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:43:30,456 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:43:30,456 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:43:30,456 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:43:30,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:43:30,456 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-04-14 00:43:30,458 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:43:30,459 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:43:30,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:43:30 BasicIcfg [2025-04-14 00:43:30,462 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:43:30,462 INFO L158 Benchmark]: Toolchain (without parser) took 7210.98ms. Allocated memory was 125.8MB in the beginning and 436.2MB in the end (delta: 310.4MB). Free memory was 87.1MB in the beginning and 203.0MB in the end (delta: -115.9MB). Peak memory consumption was 195.2MB. Max. memory is 8.0GB. [2025-04-14 00:43:30,463 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:43:30,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.83ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 72.1MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:43:30,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.53ms. Allocated memory is still 125.8MB. Free memory was 72.1MB in the beginning and 70.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:43:30,463 INFO L158 Benchmark]: Boogie Preprocessor took 41.12ms. Allocated memory is still 125.8MB. Free memory was 70.0MB in the beginning and 67.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:43:30,463 INFO L158 Benchmark]: IcfgBuilder took 778.77ms. Allocated memory is still 125.8MB. Free memory was 67.7MB in the beginning and 39.3MB in the end (delta: 28.4MB). Peak memory consumption was 56.3MB. Max. memory is 8.0GB. [2025-04-14 00:43:30,463 INFO L158 Benchmark]: TraceAbstraction took 6141.43ms. Allocated memory was 125.8MB in the beginning and 436.2MB in the end (delta: 310.4MB). Free memory was 38.7MB in the beginning and 203.0MB in the end (delta: -164.3MB). Peak memory consumption was 147.3MB. Max. memory is 8.0GB. [2025-04-14 00:43:30,464 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.23ms. Allocated memory is still 155.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.83ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 72.1MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.53ms. Allocated memory is still 125.8MB. Free memory was 72.1MB in the beginning and 70.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.12ms. Allocated memory is still 125.8MB. Free memory was 70.0MB in the beginning and 67.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 778.77ms. Allocated memory is still 125.8MB. Free memory was 67.7MB in the beginning and 39.3MB in the end (delta: 28.4MB). Peak memory consumption was 56.3MB. Max. memory is 8.0GB. * TraceAbstraction took 6141.43ms. Allocated memory was 125.8MB in the beginning and 436.2MB in the end (delta: 310.4MB). Free memory was 38.7MB in the beginning and 203.0MB in the end (delta: -164.3MB). Peak memory consumption was 147.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 40 locations, 39 edges, 4 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: 6.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 604 IncrementalHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 4184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:43:30,476 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...