/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:10:29,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:10:29,721 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:10:29,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:10:29,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:10:29,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:10:29,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:10:29,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:10:29,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:10:29,761 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:10:29,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:10:29,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:10:29,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:10:29,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:10:29,761 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:10:29,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:10:29,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:10:29,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:10:29,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:29,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:29,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:29,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:10:29,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:10:29,763 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:10:30,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:10:30,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:10:30,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:10:30,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:10:30,044 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:10:30,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-14 00:10:31,440 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1dc880e2/8b0c65b13f064411a7653e1361105fa5/FLAGed0c662dd [2025-04-14 00:10:31,767 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:10:31,768 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-14 00:10:31,786 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1dc880e2/8b0c65b13f064411a7653e1361105fa5/FLAGed0c662dd [2025-04-14 00:10:32,496 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1dc880e2/8b0c65b13f064411a7653e1361105fa5 [2025-04-14 00:10:32,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:10:32,500 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:10:32,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:32,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:10:32,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:10:32,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:32" (1/1) ... [2025-04-14 00:10:32,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160200cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:32, skipping insertion in model container [2025-04-14 00:10:32,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:32" (1/1) ... [2025-04-14 00:10:32,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:10:32,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2025-04-14 00:10:32,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:32,922 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:10:32,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2025-04-14 00:10:32,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:33,011 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:10:33,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33 WrapperNode [2025-04-14 00:10:33,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:33,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:33,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:10:33,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:10:33,020 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:10:33" (1/1) ... [2025-04-14 00:10:33,038 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:10:33" (1/1) ... [2025-04-14 00:10:33,059 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-14 00:10:33,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:33,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:10:33,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:10:33,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:10:33,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33" (1/1) ... [2025-04-14 00:10:33,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33" (1/1) ... [2025-04-14 00:10:33,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33" (1/1) ... [2025-04-14 00:10:33,090 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:10:33,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33" (1/1) ... [2025-04-14 00:10:33,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33" (1/1) ... [2025-04-14 00:10:33,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33" (1/1) ... [2025-04-14 00:10:33,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33" (1/1) ... [2025-04-14 00:10:33,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33" (1/1) ... [2025-04-14 00:10:33,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33" (1/1) ... [2025-04-14 00:10:33,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:10:33,109 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:10:33,109 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:10:33,109 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:10:33,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33" (1/1) ... [2025-04-14 00:10:33,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:33,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:10:33,140 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:10:33,143 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:10:33,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:10:33,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:10:33,161 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:10:33,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:10:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:10:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:10:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:10:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:10:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:10:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:10:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:10:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:10:33,163 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:10:33,298 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:10:33,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:10:33,488 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:10:33,489 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:10:33,489 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:10:33,626 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:10:33,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:33 BoogieIcfgContainer [2025-04-14 00:10:33,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:10:33,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:10:33,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:10:33,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:10:33,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:10:32" (1/3) ... [2025-04-14 00:10:33,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b02ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:33, skipping insertion in model container [2025-04-14 00:10:33,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:33" (2/3) ... [2025-04-14 00:10:33,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b02ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:33, skipping insertion in model container [2025-04-14 00:10:33,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:33" (3/3) ... [2025-04-14 00:10:33,635 INFO L128 eAbstractionObserver]: Analyzing ICFG safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-14 00:10:33,649 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:10:33,650 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 4 procedures, 35 locations, 31 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:10:33,651 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:10:33,695 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:10:33,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 80 flow [2025-04-14 00:10:33,755 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-14 00:10:33,759 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:33,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:10:33,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 34 transitions, 80 flow [2025-04-14 00:10:33,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 30 transitions, 69 flow [2025-04-14 00:10:33,774 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:10:33,789 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;@1abd0430, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:10:33,790 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:10:33,797 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:10:33,797 INFO L116 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-04-14 00:10:33,797 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:33,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:33,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:33,798 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:10:33,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:33,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1206787040, now seen corresponding path program 1 times [2025-04-14 00:10:33,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:33,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733634441] [2025-04-14 00:10:33,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:33,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:33,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:10:33,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:10:33,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:33,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:34,331 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:10:34,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:34,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733634441] [2025-04-14 00:10:34,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733634441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:34,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:34,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:10:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213923850] [2025-04-14 00:10:34,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:34,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:10:34,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:34,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:10:34,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:10:34,367 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2025-04-14 00:10:34,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:10:34,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:34,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2025-04-14 00:10:34,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:35,072 INFO L116 PetriNetUnfolderBase]: 3824/5568 cut-off events. [2025-04-14 00:10:35,072 INFO L117 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-04-14 00:10:35,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11218 conditions, 5568 events. 3824/5568 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 28528 event pairs, 1099 based on Foata normal form. 210/5774 useless extension candidates. Maximal degree in co-relation 11207. Up to 4766 conditions per place. [2025-04-14 00:10:35,126 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 40 selfloop transitions, 3 changer transitions 24/70 dead transitions. [2025-04-14 00:10:35,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 70 transitions, 289 flow [2025-04-14 00:10:35,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:10:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:10:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-04-14 00:10:35,147 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5823529411764706 [2025-04-14 00:10:35,149 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 5 states and 99 transitions. [2025-04-14 00:10:35,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 70 transitions, 289 flow [2025-04-14 00:10:35,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 70 transitions, 284 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:10:35,159 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 93 flow [2025-04-14 00:10:35,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-04-14 00:10:35,166 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-04-14 00:10:35,166 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 93 flow [2025-04-14 00:10:35,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:10:35,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:35,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:35,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:10:35,167 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:10:35,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash 82435041, now seen corresponding path program 1 times [2025-04-14 00:10:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:35,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992995855] [2025-04-14 00:10:35,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:35,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:35,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:10:35,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:10:35,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:35,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:35,481 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:10:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:35,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992995855] [2025-04-14 00:10:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992995855] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:10:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834982196] [2025-04-14 00:10:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:35,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:35,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:35,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:35,484 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2025-04-14 00:10:35,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:10:35,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:35,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2025-04-14 00:10:35,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:36,089 INFO L116 PetriNetUnfolderBase]: 4269/6189 cut-off events. [2025-04-14 00:10:36,089 INFO L117 PetriNetUnfolderBase]: For 2123/2125 co-relation queries the response was YES. [2025-04-14 00:10:36,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14056 conditions, 6189 events. 4269/6189 cut-off events. For 2123/2125 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 31938 event pairs, 356 based on Foata normal form. 197/6385 useless extension candidates. Maximal degree in co-relation 14043. Up to 4196 conditions per place. [2025-04-14 00:10:36,132 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 73 selfloop transitions, 11 changer transitions 44/131 dead transitions. [2025-04-14 00:10:36,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 131 transitions, 611 flow [2025-04-14 00:10:36,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:10:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:10:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2025-04-14 00:10:36,134 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6013071895424836 [2025-04-14 00:10:36,134 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 93 flow. Second operand 9 states and 184 transitions. [2025-04-14 00:10:36,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 131 transitions, 611 flow [2025-04-14 00:10:36,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 131 transitions, 598 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:36,159 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 190 flow [2025-04-14 00:10:36,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-04-14 00:10:36,160 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-04-14 00:10:36,160 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 190 flow [2025-04-14 00:10:36,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:10:36,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:36,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:36,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:10:36,160 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:10:36,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash -509057309, now seen corresponding path program 1 times [2025-04-14 00:10:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:36,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522950535] [2025-04-14 00:10:36,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:36,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:10:36,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:10:36,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:36,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:36,336 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:10:36,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:36,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522950535] [2025-04-14 00:10:36,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522950535] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:36,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:36,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:10:36,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332272213] [2025-04-14 00:10:36,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:36,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:10:36,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:36,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:10:36,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:10:36,338 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2025-04-14 00:10:36,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:10:36,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:36,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2025-04-14 00:10:36,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:37,212 INFO L116 PetriNetUnfolderBase]: 5562/8064 cut-off events. [2025-04-14 00:10:37,212 INFO L117 PetriNetUnfolderBase]: For 13405/13405 co-relation queries the response was YES. [2025-04-14 00:10:37,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22532 conditions, 8064 events. 5562/8064 cut-off events. For 13405/13405 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 42444 event pairs, 1033 based on Foata normal form. 280/8342 useless extension candidates. Maximal degree in co-relation 22512. Up to 3340 conditions per place. [2025-04-14 00:10:37,248 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 49 selfloop transitions, 5 changer transitions 57/114 dead transitions. [2025-04-14 00:10:37,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 114 transitions, 690 flow [2025-04-14 00:10:37,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:10:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:10:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2025-04-14 00:10:37,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6050420168067226 [2025-04-14 00:10:37,254 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 190 flow. Second operand 7 states and 144 transitions. [2025-04-14 00:10:37,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 114 transitions, 690 flow [2025-04-14 00:10:37,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 114 transitions, 642 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-04-14 00:10:37,278 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 155 flow [2025-04-14 00:10:37,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=155, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2025-04-14 00:10:37,279 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2025-04-14 00:10:37,279 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 155 flow [2025-04-14 00:10:37,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:10:37,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:37,280 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:10:37,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:10:37,280 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:10:37,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:37,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1896308854, now seen corresponding path program 1 times [2025-04-14 00:10:37,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:37,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638686447] [2025-04-14 00:10:37,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:37,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:37,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:10:37,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:10:37,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:37,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:37,379 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:10:37,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:37,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638686447] [2025-04-14 00:10:37,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638686447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:37,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:37,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:10:37,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049511266] [2025-04-14 00:10:37,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:37,380 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:10:37,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:37,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:10:37,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:10:37,381 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2025-04-14 00:10:37,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 34 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:10:37,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:37,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2025-04-14 00:10:37,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:37,710 INFO L116 PetriNetUnfolderBase]: 2466/3696 cut-off events. [2025-04-14 00:10:37,710 INFO L117 PetriNetUnfolderBase]: For 5831/5831 co-relation queries the response was YES. [2025-04-14 00:10:37,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10520 conditions, 3696 events. 2466/3696 cut-off events. For 5831/5831 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18237 event pairs, 359 based on Foata normal form. 175/3867 useless extension candidates. Maximal degree in co-relation 10497. Up to 1984 conditions per place. [2025-04-14 00:10:37,734 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 62 selfloop transitions, 5 changer transitions 1/71 dead transitions. [2025-04-14 00:10:37,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 449 flow [2025-04-14 00:10:37,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:10:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:10:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-14 00:10:37,736 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6323529411764706 [2025-04-14 00:10:37,736 INFO L175 Difference]: Start difference. First operand has 58 places, 34 transitions, 155 flow. Second operand 4 states and 86 transitions. [2025-04-14 00:10:37,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 449 flow [2025-04-14 00:10:37,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 405 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-04-14 00:10:37,746 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 165 flow [2025-04-14 00:10:37,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2025-04-14 00:10:37,747 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-04-14 00:10:37,747 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 165 flow [2025-04-14 00:10:37,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:10:37,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:37,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:37,749 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:10:37,749 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:10:37,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:37,749 INFO L85 PathProgramCache]: Analyzing trace with hash 142322655, now seen corresponding path program 1 times [2025-04-14 00:10:37,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:37,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211370] [2025-04-14 00:10:37,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:37,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:37,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:10:37,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:10:37,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:37,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:37,869 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:10:37,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:37,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211370] [2025-04-14 00:10:37,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:37,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:37,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:10:37,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868853565] [2025-04-14 00:10:37,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:37,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:37,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:37,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:37,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:37,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2025-04-14 00:10:37,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:10:37,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:37,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2025-04-14 00:10:37,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:38,151 INFO L116 PetriNetUnfolderBase]: 1525/2352 cut-off events. [2025-04-14 00:10:38,151 INFO L117 PetriNetUnfolderBase]: For 2591/2591 co-relation queries the response was YES. [2025-04-14 00:10:38,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6791 conditions, 2352 events. 1525/2352 cut-off events. For 2591/2591 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 10604 event pairs, 221 based on Foata normal form. 130/2478 useless extension candidates. Maximal degree in co-relation 6772. Up to 777 conditions per place. [2025-04-14 00:10:38,168 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 73 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2025-04-14 00:10:38,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 85 transitions, 512 flow [2025-04-14 00:10:38,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:10:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:10:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-04-14 00:10:38,169 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2025-04-14 00:10:38,169 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 165 flow. Second operand 5 states and 108 transitions. [2025-04-14 00:10:38,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 85 transitions, 512 flow [2025-04-14 00:10:38,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 496 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 00:10:38,175 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 200 flow [2025-04-14 00:10:38,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-04-14 00:10:38,176 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-04-14 00:10:38,176 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 200 flow [2025-04-14 00:10:38,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:10:38,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:38,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:38,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:10:38,177 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:10:38,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 163020430, now seen corresponding path program 1 times [2025-04-14 00:10:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:38,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244231443] [2025-04-14 00:10:38,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:38,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:38,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:10:38,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:10:38,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:38,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:38,289 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:10:38,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:38,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244231443] [2025-04-14 00:10:38,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244231443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:38,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:38,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:10:38,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825332362] [2025-04-14 00:10:38,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:38,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:10:38,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:38,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:10:38,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:10:38,291 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2025-04-14 00:10:38,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:38,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:38,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2025-04-14 00:10:38,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:38,499 INFO L116 PetriNetUnfolderBase]: 952/1489 cut-off events. [2025-04-14 00:10:38,500 INFO L117 PetriNetUnfolderBase]: For 2113/2113 co-relation queries the response was YES. [2025-04-14 00:10:38,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4486 conditions, 1489 events. 952/1489 cut-off events. For 2113/2113 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6236 event pairs, 192 based on Foata normal form. 52/1537 useless extension candidates. Maximal degree in co-relation 4466. Up to 550 conditions per place. [2025-04-14 00:10:38,505 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 63 selfloop transitions, 11 changer transitions 1/78 dead transitions. [2025-04-14 00:10:38,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 483 flow [2025-04-14 00:10:38,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:10:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:10:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2025-04-14 00:10:38,506 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5245098039215687 [2025-04-14 00:10:38,506 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 200 flow. Second operand 6 states and 107 transitions. [2025-04-14 00:10:38,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 483 flow [2025-04-14 00:10:38,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 440 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-04-14 00:10:38,511 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 200 flow [2025-04-14 00:10:38,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2025-04-14 00:10:38,513 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-04-14 00:10:38,513 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 200 flow [2025-04-14 00:10:38,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:38,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:38,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:38,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:10:38,513 INFO L403 AbstractCegarLoop]: === Iteration 7 === 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:10:38,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:38,514 INFO L85 PathProgramCache]: Analyzing trace with hash 640580917, now seen corresponding path program 1 times [2025-04-14 00:10:38,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:38,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33980187] [2025-04-14 00:10:38,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:38,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:38,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:10:38,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:10:38,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:38,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:38,651 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:10:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:38,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33980187] [2025-04-14 00:10:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33980187] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:38,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:38,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:10:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472345900] [2025-04-14 00:10:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:38,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:38,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:38,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:38,653 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2025-04-14 00:10:38,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:38,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:38,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2025-04-14 00:10:38,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:38,864 INFO L116 PetriNetUnfolderBase]: 1260/1963 cut-off events. [2025-04-14 00:10:38,864 INFO L117 PetriNetUnfolderBase]: For 2699/2699 co-relation queries the response was YES. [2025-04-14 00:10:38,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5836 conditions, 1963 events. 1260/1963 cut-off events. For 2699/2699 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8542 event pairs, 246 based on Foata normal form. 8/1970 useless extension candidates. Maximal degree in co-relation 5816. Up to 1162 conditions per place. [2025-04-14 00:10:38,874 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 41 selfloop transitions, 1 changer transitions 36/81 dead transitions. [2025-04-14 00:10:38,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 561 flow [2025-04-14 00:10:38,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:10:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:10:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-04-14 00:10:38,876 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5352941176470588 [2025-04-14 00:10:38,876 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 200 flow. Second operand 5 states and 91 transitions. [2025-04-14 00:10:38,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 561 flow [2025-04-14 00:10:38,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 428 flow, removed 24 selfloop flow, removed 9 redundant places. [2025-04-14 00:10:38,886 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 129 flow [2025-04-14 00:10:38,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2025-04-14 00:10:38,886 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-04-14 00:10:38,886 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 129 flow [2025-04-14 00:10:38,887 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:38,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:38,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:38,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:10:38,887 INFO L403 AbstractCegarLoop]: === Iteration 8 === 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:10:38,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash 342755179, now seen corresponding path program 2 times [2025-04-14 00:10:38,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:38,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044706680] [2025-04-14 00:10:38,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:10:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:38,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:10:38,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:10:38,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:10:38,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:39,031 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:10:39,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:39,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044706680] [2025-04-14 00:10:39,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044706680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:39,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:39,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:10:39,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126142136] [2025-04-14 00:10:39,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:39,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:39,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:39,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:39,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:39,032 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2025-04-14 00:10:39,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:39,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:39,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2025-04-14 00:10:39,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:39,150 INFO L116 PetriNetUnfolderBase]: 636/1021 cut-off events. [2025-04-14 00:10:39,151 INFO L117 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2025-04-14 00:10:39,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 1021 events. 636/1021 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3863 event pairs, 148 based on Foata normal form. 8/1028 useless extension candidates. Maximal degree in co-relation 2552. Up to 516 conditions per place. [2025-04-14 00:10:39,153 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 0 selfloop transitions, 0 changer transitions 52/52 dead transitions. [2025-04-14 00:10:39,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 270 flow [2025-04-14 00:10:39,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:10:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:10:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-04-14 00:10:39,154 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2025-04-14 00:10:39,154 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 129 flow. Second operand 5 states and 72 transitions. [2025-04-14 00:10:39,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 270 flow [2025-04-14 00:10:39,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 262 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-14 00:10:39,156 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2025-04-14 00:10:39,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2025-04-14 00:10:39,157 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-04-14 00:10:39,157 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2025-04-14 00:10:39,157 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:39,159 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:10:39,159 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:10:39,159 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:10:39,159 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:10:39,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:10:39,163 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:39,165 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:10:39,165 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:10:39,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:10:39 BasicIcfg [2025-04-14 00:10:39,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:10:39,173 INFO L158 Benchmark]: Toolchain (without parser) took 6673.45ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 99.8MB in the beginning and 83.9MB in the end (delta: 15.9MB). Peak memory consumption was 275.8MB. Max. memory is 8.0GB. [2025-04-14 00:10:39,173 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:10:39,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.53ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 75.9MB in the end (delta: 23.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 00:10:39,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.77ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 74.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:10:39,174 INFO L158 Benchmark]: Boogie Preprocessor took 46.55ms. Allocated memory is still 142.6MB. Free memory was 74.1MB in the beginning and 72.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:10:39,174 INFO L158 Benchmark]: IcfgBuilder took 516.88ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 49.0MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:10:39,174 INFO L158 Benchmark]: TraceAbstraction took 5545.03ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 48.4MB in the beginning and 83.9MB in the end (delta: -35.5MB). Peak memory consumption was 229.6MB. Max. memory is 8.0GB. [2025-04-14 00:10:39,175 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 155.2MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 512.53ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 75.9MB in the end (delta: 23.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.77ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 74.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 46.55ms. Allocated memory is still 142.6MB. Free memory was 74.1MB in the beginning and 72.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 516.88ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 49.0MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 5545.03ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 48.4MB in the beginning and 83.9MB in the end (delta: -35.5MB). Peak memory consumption was 229.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: 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, 59 locations, 55 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: 5.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 491 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 491 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 961 IncrementalHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 0 mSDtfsCounter, 961 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=5, InterpolantAutomatonStates: 46, 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, 1.4s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 553 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:10:39,187 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...