/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/parallel-misc-2-unrolled.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:52:42,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:52:42,149 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:52:42,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:52:42,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:52:42,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:52:42,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:52:42,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:52:42,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:52:42,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:52:42,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:52:42,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:52:42,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:52:42,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:52:42,187 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:52:42,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:52:42,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:52:42,187 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:52:42,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:52:42,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:52:42,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:52:42,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:52:42,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:52:42,188 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:52:42,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:52:42,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:52:42,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:52:42,189 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:52:42,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:52:42,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:52:42,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:52:42,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:52:42,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:52:42,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:52:42,189 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:52:42,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:52:42,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:52:42,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:52:42,435 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:52:42,437 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:52:42,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c [2025-04-14 00:52:43,739 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22ffb390/b5b3b19b4ab547379f21908354fc4382/FLAGfd11cc238 [2025-04-14 00:52:43,995 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:52:43,996 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c [2025-04-14 00:52:44,002 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22ffb390/b5b3b19b4ab547379f21908354fc4382/FLAGfd11cc238 [2025-04-14 00:52:44,739 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22ffb390/b5b3b19b4ab547379f21908354fc4382 [2025-04-14 00:52:44,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:52:44,743 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:52:44,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:52:44,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:52:44,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:52:44,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:44,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b29c69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44, skipping insertion in model container [2025-04-14 00:52:44,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:44,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:52:44,937 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/parallel-misc-2-unrolled.wvr.c[2043,2056] [2025-04-14 00:52:44,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:52:44,945 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:52:44,966 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/parallel-misc-2-unrolled.wvr.c[2043,2056] [2025-04-14 00:52:44,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:52:44,978 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:52:44,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44 WrapperNode [2025-04-14 00:52:44,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:52:44,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:52:44,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:52:44,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:52:44,984 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:52:44" (1/1) ... [2025-04-14 00:52:44,990 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:52:44" (1/1) ... [2025-04-14 00:52:45,001 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2025-04-14 00:52:45,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:52:45,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:52:45,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:52:45,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:52:45,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:45,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:45,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:45,028 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:52:45,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:45,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:45,031 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:45,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:45,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:45,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:45,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:52:45,041 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:52:45,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:52:45,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:52:45,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44" (1/1) ... [2025-04-14 00:52:45,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:52:45,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:52:45,068 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:52:45,070 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:52:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:52:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:52:45,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:52:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:52:45,086 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:52:45,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:52:45,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:52:45,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:52:45,086 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:52:45,148 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:52:45,150 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:52:45,276 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:52:45,277 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:52:45,277 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:52:45,378 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:52:45,386 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:52:45,393 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:52:45,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:52:45 BoogieIcfgContainer [2025-04-14 00:52:45,394 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:52:45,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:52:45,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:52:45,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:52:45,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:52:44" (1/3) ... [2025-04-14 00:52:45,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76134fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:52:45, skipping insertion in model container [2025-04-14 00:52:45,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:44" (2/3) ... [2025-04-14 00:52:45,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76134fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:52:45, skipping insertion in model container [2025-04-14 00:52:45,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:52:45" (3/3) ... [2025-04-14 00:52:45,400 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2-unrolled.wvr.c [2025-04-14 00:52:45,411 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:52:45,412 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2-unrolled.wvr.c that has 3 procedures, 24 locations, 25 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 00:52:45,412 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:52:45,458 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:52:45,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2025-04-14 00:52:45,508 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-14 00:52:45,511 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:52:45,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 4/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-14 00:52:45,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2025-04-14 00:52:45,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 24 transitions, 60 flow [2025-04-14 00:52:45,522 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:52:45,529 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;@614f63e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:52:45,530 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:52:45,538 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:52:45,538 INFO L116 PetriNetUnfolderBase]: 4/23 cut-off events. [2025-04-14 00:52:45,538 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:52:45,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:45,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:45,539 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:45,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:45,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2088790578, now seen corresponding path program 1 times [2025-04-14 00:52:45,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:45,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444694275] [2025-04-14 00:52:45,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:45,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:45,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:52:45,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:52:45,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:45,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:45,769 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:52:45,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:45,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444694275] [2025-04-14 00:52:45,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444694275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:45,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:45,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:52:45,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663562723] [2025-04-14 00:52:45,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:45,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:52:45,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:45,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:52:45,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:52:45,803 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 00:52:45,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:52:45,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:45,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 00:52:45,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:45,949 INFO L116 PetriNetUnfolderBase]: 179/298 cut-off events. [2025-04-14 00:52:45,949 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-14 00:52:45,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 298 events. 179/298 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 946 event pairs, 34 based on Foata normal form. 1/236 useless extension candidates. Maximal degree in co-relation 560. Up to 247 conditions per place. [2025-04-14 00:52:45,956 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 29 selfloop transitions, 5 changer transitions 1/35 dead transitions. [2025-04-14 00:52:45,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 161 flow [2025-04-14 00:52:45,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:52:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:52:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-14 00:52:45,965 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-14 00:52:45,966 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 60 flow. Second operand 3 states and 42 transitions. [2025-04-14 00:52:45,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 161 flow [2025-04-14 00:52:45,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 35 transitions, 147 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:52:45,973 INFO L231 Difference]: Finished difference. Result has 26 places, 26 transitions, 77 flow [2025-04-14 00:52:45,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=26, PETRI_TRANSITIONS=26} [2025-04-14 00:52:45,978 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2025-04-14 00:52:45,978 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 26 transitions, 77 flow [2025-04-14 00:52:45,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:52:45,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:45,978 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:52:45,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:52:45,979 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:45,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1268059130, now seen corresponding path program 1 times [2025-04-14 00:52:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:45,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662898739] [2025-04-14 00:52:45,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:45,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:52:46,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:52:46,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:46,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:46,122 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:52:46,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:46,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662898739] [2025-04-14 00:52:46,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662898739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:46,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:46,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:46,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859899237] [2025-04-14 00:52:46,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:46,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:46,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:46,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:46,123 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 00:52:46,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 26 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:52:46,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:46,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 00:52:46,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:46,296 INFO L116 PetriNetUnfolderBase]: 195/347 cut-off events. [2025-04-14 00:52:46,296 INFO L117 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-04-14 00:52:46,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 347 events. 195/347 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1274 event pairs, 13 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 229. Up to 118 conditions per place. [2025-04-14 00:52:46,300 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 46 selfloop transitions, 9 changer transitions 1/56 dead transitions. [2025-04-14 00:52:46,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 56 transitions, 264 flow [2025-04-14 00:52:46,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-04-14 00:52:46,301 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2025-04-14 00:52:46,301 INFO L175 Difference]: Start difference. First operand has 26 places, 26 transitions, 77 flow. Second operand 5 states and 66 transitions. [2025-04-14 00:52:46,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 56 transitions, 264 flow [2025-04-14 00:52:46,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 56 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:52:46,303 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 130 flow [2025-04-14 00:52:46,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-04-14 00:52:46,303 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2025-04-14 00:52:46,303 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 130 flow [2025-04-14 00:52:46,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:52:46,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:46,303 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:52:46,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:52:46,304 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:46,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -414471732, now seen corresponding path program 2 times [2025-04-14 00:52:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:46,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321770186] [2025-04-14 00:52:46,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:46,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:52:46,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:52:46,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:46,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:46,426 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:52:46,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:46,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321770186] [2025-04-14 00:52:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321770186] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:46,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:46,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:46,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106693209] [2025-04-14 00:52:46,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:46,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:46,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:46,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:46,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:46,427 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 00:52:46,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:52:46,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:46,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 00:52:46,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:46,564 INFO L116 PetriNetUnfolderBase]: 190/331 cut-off events. [2025-04-14 00:52:46,564 INFO L117 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-04-14 00:52:46,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 331 events. 190/331 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1138 event pairs, 23 based on Foata normal form. 2/333 useless extension candidates. Maximal degree in co-relation 256. Up to 176 conditions per place. [2025-04-14 00:52:46,568 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 44 selfloop transitions, 13 changer transitions 4/61 dead transitions. [2025-04-14 00:52:46,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 61 transitions, 355 flow [2025-04-14 00:52:46,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-14 00:52:46,570 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2025-04-14 00:52:46,570 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 130 flow. Second operand 5 states and 64 transitions. [2025-04-14 00:52:46,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 61 transitions, 355 flow [2025-04-14 00:52:46,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 61 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:52:46,574 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 195 flow [2025-04-14 00:52:46,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2025-04-14 00:52:46,575 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2025-04-14 00:52:46,575 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 195 flow [2025-04-14 00:52:46,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:52:46,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:46,575 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:52:46,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:52:46,575 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:46,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1603683320, now seen corresponding path program 1 times [2025-04-14 00:52:46,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:46,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444812371] [2025-04-14 00:52:46,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:46,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:46,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:52:46,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:52:46,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:46,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:46,664 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:52:46,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:46,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444812371] [2025-04-14 00:52:46,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444812371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:46,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:46,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:46,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740508237] [2025-04-14 00:52:46,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:46,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:46,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:46,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:46,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:46,666 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 00:52:46,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:52:46,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:46,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 00:52:46,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:46,772 INFO L116 PetriNetUnfolderBase]: 185/344 cut-off events. [2025-04-14 00:52:46,772 INFO L117 PetriNetUnfolderBase]: For 437/437 co-relation queries the response was YES. [2025-04-14 00:52:46,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 344 events. 185/344 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1217 event pairs, 18 based on Foata normal form. 14/358 useless extension candidates. Maximal degree in co-relation 308. Up to 147 conditions per place. [2025-04-14 00:52:46,775 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 53 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2025-04-14 00:52:46,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 63 transitions, 414 flow [2025-04-14 00:52:46,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2025-04-14 00:52:46,777 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-14 00:52:46,777 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 195 flow. Second operand 5 states and 63 transitions. [2025-04-14 00:52:46,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 63 transitions, 414 flow [2025-04-14 00:52:46,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 401 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-14 00:52:46,781 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 220 flow [2025-04-14 00:52:46,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2025-04-14 00:52:46,783 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2025-04-14 00:52:46,783 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 220 flow [2025-04-14 00:52:46,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:52:46,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:46,783 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:52:46,783 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:52:46,784 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:46,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:46,784 INFO L85 PathProgramCache]: Analyzing trace with hash 966084606, now seen corresponding path program 2 times [2025-04-14 00:52:46,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:46,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555543814] [2025-04-14 00:52:46,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:46,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:46,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:52:46,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:52:46,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:46,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:46,866 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:52:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:46,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555543814] [2025-04-14 00:52:46,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555543814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:46,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:46,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454650046] [2025-04-14 00:52:46,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:46,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:46,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:46,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:46,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 00:52:46,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:52:46,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:46,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 00:52:46,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:46,959 INFO L116 PetriNetUnfolderBase]: 170/310 cut-off events. [2025-04-14 00:52:46,959 INFO L117 PetriNetUnfolderBase]: For 457/457 co-relation queries the response was YES. [2025-04-14 00:52:46,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 310 events. 170/310 cut-off events. For 457/457 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1022 event pairs, 24 based on Foata normal form. 3/313 useless extension candidates. Maximal degree in co-relation 551. Up to 210 conditions per place. [2025-04-14 00:52:46,961 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 44 selfloop transitions, 10 changer transitions 4/58 dead transitions. [2025-04-14 00:52:46,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 403 flow [2025-04-14 00:52:46,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-04-14 00:52:46,964 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2025-04-14 00:52:46,964 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 220 flow. Second operand 5 states and 57 transitions. [2025-04-14 00:52:46,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 403 flow [2025-04-14 00:52:46,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 386 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:46,969 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 249 flow [2025-04-14 00:52:46,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2025-04-14 00:52:46,969 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 19 predicate places. [2025-04-14 00:52:46,970 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 249 flow [2025-04-14 00:52:46,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:52:46,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:46,970 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:52:46,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:52:46,970 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:46,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1664935952, now seen corresponding path program 1 times [2025-04-14 00:52:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:46,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586759076] [2025-04-14 00:52:46,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:46,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:46,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:52:46,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:52:46,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:46,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:47,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:52:47,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:47,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586759076] [2025-04-14 00:52:47,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586759076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:47,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:47,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:52:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127976409] [2025-04-14 00:52:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:47,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:52:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:47,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:52:47,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:52:47,175 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 00:52:47,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:52:47,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:47,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 00:52:47,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:47,300 INFO L116 PetriNetUnfolderBase]: 167/301 cut-off events. [2025-04-14 00:52:47,300 INFO L117 PetriNetUnfolderBase]: For 544/544 co-relation queries the response was YES. [2025-04-14 00:52:47,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 301 events. 167/301 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 982 event pairs, 38 based on Foata normal form. 1/302 useless extension candidates. Maximal degree in co-relation 763. Up to 123 conditions per place. [2025-04-14 00:52:47,301 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 0 selfloop transitions, 0 changer transitions 61/61 dead transitions. [2025-04-14 00:52:47,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 483 flow [2025-04-14 00:52:47,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:52:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:52:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2025-04-14 00:52:47,302 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32098765432098764 [2025-04-14 00:52:47,302 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 249 flow. Second operand 6 states and 52 transitions. [2025-04-14 00:52:47,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 483 flow [2025-04-14 00:52:47,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 455 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 00:52:47,305 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2025-04-14 00:52:47,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2025-04-14 00:52:47,307 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2025-04-14 00:52:47,307 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2025-04-14 00:52:47,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:52:47,309 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 00:52:47,310 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 00:52:47,310 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 00:52:47,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:52:47,310 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-04-14 00:52:47,312 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:52:47,312 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:52:47,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:52:47 BasicIcfg [2025-04-14 00:52:47,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:52:47,317 INFO L158 Benchmark]: Toolchain (without parser) took 2574.43ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 75.0MB in the end (delta: 23.9MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. [2025-04-14 00:52:47,317 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 163.6MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:52:47,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.40ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 84.5MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:52:47,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.40ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:52:47,317 INFO L158 Benchmark]: Boogie Preprocessor took 38.66ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:52:47,317 INFO L158 Benchmark]: IcfgBuilder took 352.39ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 57.7MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:52:47,318 INFO L158 Benchmark]: TraceAbstraction took 1921.18ms. Allocated memory is still 142.6MB. Free memory was 57.7MB in the beginning and 75.0MB in the end (delta: -17.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:52:47,320 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.22ms. Allocated memory is still 163.6MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.40ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 84.5MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.40ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 38.66ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 352.39ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 57.7MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 1921.18ms. Allocated memory is still 142.6MB. Free memory was 57.7MB in the beginning and 75.0MB in the end (delta: -17.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 78]: 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 5 procedures, 38 locations, 45 edges, 3 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: 1.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 501 IncrementalHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 0 mSDtfsCounter, 501 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=5, InterpolantAutomatonStates: 29, 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.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 433 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:52:47,336 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...