/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 FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:37:57,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:37:57,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:37:57,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:37:57,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:37:57,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:37:57,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:37:57,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:37:57,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:37:57,896 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:37:57,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:37:57,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:37:57,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:37:57,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:37:57,896 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:37:57,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:37:57,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:37:57,896 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:37:57,897 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:37:57,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:37:57,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:37:57,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:37:57,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:37:57,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:37:57,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:37:57,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:37:57,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:37:57,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:37:57,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:37:57,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:37:57,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:37:57,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:37:57,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:37:57,898 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 -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:37:58,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:37:58,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:37:58,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:37:58,108 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:37:58,108 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:37:58,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2025-04-13 21:37:59,387 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd94ffb0/e5e3e665aa5441b7aa908e720364065b/FLAG8517aeeec [2025-04-13 21:37:59,619 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:37:59,619 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2025-04-13 21:37:59,632 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd94ffb0/e5e3e665aa5441b7aa908e720364065b/FLAG8517aeeec [2025-04-13 21:38:00,438 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd94ffb0/e5e3e665aa5441b7aa908e720364065b [2025-04-13 21:38:00,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:38:00,441 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:38:00,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:38:00,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:38:00,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:38:00,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1381f8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00, skipping insertion in model container [2025-04-13 21:38:00,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:38:00,760 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-ext/40_barrier_vf.i[30834,30847] [2025-04-13 21:38:00,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:38:00,788 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:38:00,841 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-ext/40_barrier_vf.i[30834,30847] [2025-04-13 21:38:00,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:38:00,869 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:38:00,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00 WrapperNode [2025-04-13 21:38:00,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:38:00,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:38:00,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:38:00,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:38:00,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,910 INFO L138 Inliner]: procedures = 164, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 166 [2025-04-13 21:38:00,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:38:00,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:38:00,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:38:00,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:38:00,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,942 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-04-13 21:38:00,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:38:00,959 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:38:00,959 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:38:00,959 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:38:00,963 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (1/1) ... [2025-04-13 21:38:00,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:38:00,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:38:00,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:38:00,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:38:01,004 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 21:38:01,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 21:38:01,005 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:38:01,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:38:01,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:38:01,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:38:01,005 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:38:01,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:38:01,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:38:01,006 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:38:01,098 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:38:01,099 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:38:01,274 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:38:01,275 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:38:01,275 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:38:01,908 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:38:01,922 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:38:01,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:38:01 BoogieIcfgContainer [2025-04-13 21:38:01,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:38:01,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:38:01,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:38:01,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:38:01,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:38:00" (1/3) ... [2025-04-13 21:38:01,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bd2171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:38:01, skipping insertion in model container [2025-04-13 21:38:01,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:38:00" (2/3) ... [2025-04-13 21:38:01,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bd2171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:38:01, skipping insertion in model container [2025-04-13 21:38:01,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:38:01" (3/3) ... [2025-04-13 21:38:01,928 INFO L128 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2025-04-13 21:38:01,939 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:38:01,940 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 40_barrier_vf.i that has 2 procedures, 14 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 21:38:01,940 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:38:01,974 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:38:01,998 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 17 places, 17 transitions, 38 flow [2025-04-13 21:38:02,006 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 41 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:02,025 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:38:02,033 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=FINITE_AUTOMATA, 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;@2cc6e0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:38:02,033 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:38:02,036 INFO L278 IsEmpty]: Start isEmpty. Operand has 41 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:02,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-13 21:38:02,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:38:02,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-13 21:38:02,040 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 21:38:02,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:38:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash 11694289, now seen corresponding path program 1 times [2025-04-13 21:38:02,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:38:02,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727444640] [2025-04-13 21:38:02,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:38:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:38:02,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 21:38:02,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 21:38:02,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:02,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:38:02,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:38:02,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 21:38:02,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 21:38:02,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:02,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:38:02,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:38:02,401 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:38:02,402 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 21:38:02,403 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 21:38:02,404 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 21:38:02,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:38:02,408 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 21:38:02,410 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:38:02,410 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 21:38:02,450 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:38:02,454 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 29 transitions, 68 flow [2025-04-13 21:38:02,498 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 430 states, 422 states have (on average 2.938388625592417) internal successors, (1240), 429 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:02,500 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:38:02,501 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=FINITE_AUTOMATA, 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;@2cc6e0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:38:02,501 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 21:38:02,506 INFO L278 IsEmpty]: Start isEmpty. Operand has 430 states, 422 states have (on average 2.938388625592417) internal successors, (1240), 429 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:02,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 21:38:02,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:38:02,507 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 21:38:02,507 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 21:38:02,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:38:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash -778587288, now seen corresponding path program 1 times [2025-04-13 21:38:02,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:38:02,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390877290] [2025-04-13 21:38:02,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:38:02,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:38:02,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:38:02,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:38:02,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:02,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:38:02,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:38:02,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:38:02,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:38:02,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:02,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:38:02,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:38:02,725 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:38:02,725 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 21:38:02,725 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 21:38:02,725 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 21:38:02,725 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 21:38:02,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:38:02,726 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 21:38:02,726 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:38:02,726 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 21:38:02,746 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:38:02,748 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 41 transitions, 100 flow [2025-04-13 21:38:02,901 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4329 states, 4310 states have (on average 3.994431554524362) internal successors, (17216), 4328 states have internal predecessors, (17216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:02,903 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:38:02,903 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=FINITE_AUTOMATA, 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;@2cc6e0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:38:02,903 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 21:38:02,916 INFO L278 IsEmpty]: Start isEmpty. Operand has 4329 states, 4310 states have (on average 3.994431554524362) internal successors, (17216), 4328 states have internal predecessors, (17216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:02,917 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 21:38:02,917 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:38:02,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:38:02,917 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 21:38:02,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:38:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash 912520751, now seen corresponding path program 1 times [2025-04-13 21:38:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:38:02,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289173467] [2025-04-13 21:38:02,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:38:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:38:03,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:38:03,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:38:03,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:03,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:38:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:38:03,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:38:03,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289173467] [2025-04-13 21:38:03,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289173467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:38:03,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:38:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:38:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270175451] [2025-04-13 21:38:03,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:38:03,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:38:03,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:38:03,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:38:03,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:38:03,203 INFO L87 Difference]: Start difference. First operand has 4329 states, 4310 states have (on average 3.994431554524362) internal successors, (17216), 4328 states have internal predecessors, (17216), 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:38:03,456 INFO L93 Difference]: Finished difference Result 7314 states and 30569 transitions. [2025-04-13 21:38:03,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:38:03,459 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2025-04-13 21:38:03,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:38:03,523 INFO L225 Difference]: With dead ends: 7314 [2025-04-13 21:38:03,524 INFO L226 Difference]: Without dead ends: 3719 [2025-04-13 21:38:03,537 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:38:03,538 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:38:03,539 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 20 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:38:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-04-13 21:38:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3152. [2025-04-13 21:38:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3151 states have (on average 3.7689622342113616) internal successors, (11876), 3151 states have internal predecessors, (11876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 11876 transitions. [2025-04-13 21:38:03,780 INFO L79 Accepts]: Start accepts. Automaton has 3152 states and 11876 transitions. Word has length 7 [2025-04-13 21:38:03,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:38:03,782 INFO L485 AbstractCegarLoop]: Abstraction has 3152 states and 11876 transitions. [2025-04-13 21:38:03,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:03,783 INFO L278 IsEmpty]: Start isEmpty. Operand 3152 states and 11876 transitions. [2025-04-13 21:38:03,783 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 21:38:03,783 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:38:03,783 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 21:38:03,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:38:03,784 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 21:38:03,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:38:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1966330134, now seen corresponding path program 1 times [2025-04-13 21:38:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:38:03,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4579084] [2025-04-13 21:38:03,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:38:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:38:03,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:38:03,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:38:03,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:03,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:38:03,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:38:03,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:38:03,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:38:03,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:03,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:38:03,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:38:03,915 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:38:03,915 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 21:38:03,915 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 21:38:03,915 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 21:38:03,915 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 21:38:03,916 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 21:38:03,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:38:03,916 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 21:38:03,916 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:38:03,916 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 21:38:03,938 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:38:03,939 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 53 transitions, 134 flow [2025-04-13 21:38:05,183 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 43328 states, 43286 states have (on average 5.080418611098277) internal successors, (219911), 43327 states have internal predecessors, (219911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:05,261 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:38:05,261 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=FINITE_AUTOMATA, 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;@2cc6e0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:38:05,261 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:38:05,361 INFO L278 IsEmpty]: Start isEmpty. Operand has 43328 states, 43286 states have (on average 5.080418611098277) internal successors, (219911), 43327 states have internal predecessors, (219911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:05,362 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 21:38:05,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:38:05,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:38:05,363 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:38:05,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:38:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1696050524, now seen corresponding path program 1 times [2025-04-13 21:38:05,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:38:05,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718083095] [2025-04-13 21:38:05,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:38:05,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:38:05,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:38:05,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:38:05,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:05,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:38:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:38:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:38:05,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718083095] [2025-04-13 21:38:05,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718083095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:38:05,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:38:05,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:38:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403858442] [2025-04-13 21:38:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:38:05,503 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:38:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:38:05,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:38:05,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:38:05,596 INFO L87 Difference]: Start difference. First operand has 43328 states, 43286 states have (on average 5.080418611098277) internal successors, (219911), 43327 states have internal predecessors, (219911), 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:38:07,418 INFO L93 Difference]: Finished difference Result 75986 states and 406685 transitions. [2025-04-13 21:38:07,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:38:07,424 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2025-04-13 21:38:07,424 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:38:07,853 INFO L225 Difference]: With dead ends: 75986 [2025-04-13 21:38:07,853 INFO L226 Difference]: Without dead ends: 37064 [2025-04-13 21:38:07,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:38:07,932 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:38:07,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 26 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:38:07,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37064 states. [2025-04-13 21:38:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37064 to 33419. [2025-04-13 21:38:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33419 states, 33418 states have (on average 4.810401579986833) internal successors, (160754), 33418 states have internal predecessors, (160754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33419 states to 33419 states and 160754 transitions. [2025-04-13 21:38:09,818 INFO L79 Accepts]: Start accepts. Automaton has 33419 states and 160754 transitions. Word has length 7 [2025-04-13 21:38:09,818 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:38:09,818 INFO L485 AbstractCegarLoop]: Abstraction has 33419 states and 160754 transitions. [2025-04-13 21:38:09,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:09,825 INFO L278 IsEmpty]: Start isEmpty. Operand 33419 states and 160754 transitions. [2025-04-13 21:38:09,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 21:38:09,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:38:09,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:38:09,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:38:09,827 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:38:09,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:38:09,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1037988988, now seen corresponding path program 1 times [2025-04-13 21:38:09,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:38:09,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803693983] [2025-04-13 21:38:09,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:38:09,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:38:10,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:38:10,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:38:10,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:10,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:38:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:38:10,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:38:10,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803693983] [2025-04-13 21:38:10,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803693983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:38:10,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:38:10,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:38:10,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008438602] [2025-04-13 21:38:10,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:38:10,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:38:10,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:38:10,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:38:10,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:38:10,314 INFO L87 Difference]: Start difference. First operand 33419 states and 160754 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:38:11,236 INFO L93 Difference]: Finished difference Result 49988 states and 235316 transitions. [2025-04-13 21:38:11,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:38:11,237 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2025-04-13 21:38:11,237 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:38:11,527 INFO L225 Difference]: With dead ends: 49988 [2025-04-13 21:38:11,528 INFO L226 Difference]: Without dead ends: 27329 [2025-04-13 21:38:11,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:38:11,563 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:38:11,563 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:38:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27329 states. [2025-04-13 21:38:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27329 to 27329. [2025-04-13 21:38:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27329 states, 27328 states have (on average 4.662324355971897) internal successors, (127412), 27328 states have internal predecessors, (127412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27329 states to 27329 states and 127412 transitions. [2025-04-13 21:38:12,373 INFO L79 Accepts]: Start accepts. Automaton has 27329 states and 127412 transitions. Word has length 8 [2025-04-13 21:38:12,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:38:12,373 INFO L485 AbstractCegarLoop]: Abstraction has 27329 states and 127412 transitions. [2025-04-13 21:38:12,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:12,374 INFO L278 IsEmpty]: Start isEmpty. Operand 27329 states and 127412 transitions. [2025-04-13 21:38:12,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 21:38:12,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:38:12,374 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 21:38:12,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:38:12,375 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 21:38:12,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:38:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1257163301, now seen corresponding path program 1 times [2025-04-13 21:38:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:38:12,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344345452] [2025-04-13 21:38:12,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:38:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:38:12,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:38:12,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:38:12,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:12,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:38:12,443 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:38:12,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:38:12,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:38:12,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:12,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:38:12,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:38:12,470 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:38:12,470 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 21:38:12,470 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 21:38:12,470 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 21:38:12,470 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 21:38:12,470 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 21:38:12,470 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 21:38:12,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:38:12,471 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 21:38:12,471 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:38:12,471 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 21:38:12,499 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:38:12,500 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 65 transitions, 170 flow [2025-04-13 21:38:25,358 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 433327 states, 433238 states have (on average 6.176524219943772) internal successors, (2675905), 433326 states have internal predecessors, (2675905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:25,363 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:38:25,363 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=FINITE_AUTOMATA, 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;@2cc6e0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:38:25,363 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 21:38:26,343 INFO L278 IsEmpty]: Start isEmpty. Operand has 433327 states, 433238 states have (on average 6.176524219943772) internal successors, (2675905), 433326 states have internal predecessors, (2675905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:26,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 21:38:26,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:38:26,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:38:26,344 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 21:38:26,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:38:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1910505457, now seen corresponding path program 1 times [2025-04-13 21:38:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:38:26,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888178026] [2025-04-13 21:38:26,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:38:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:38:26,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:38:26,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:38:26,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:38:26,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:38:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:38:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:38:26,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888178026] [2025-04-13 21:38:26,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888178026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:38:26,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:38:26,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:38:26,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928362948] [2025-04-13 21:38:26,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:38:26,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:38:26,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:38:26,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:38:26,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:38:27,366 INFO L87 Difference]: Start difference. First operand has 433327 states, 433238 states have (on average 6.176524219943772) internal successors, (2675905), 433326 states have internal predecessors, (2675905), 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:38:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:38:43,552 INFO L93 Difference]: Finished difference Result 759772 states and 4948969 transitions. [2025-04-13 21:38:43,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:38:43,553 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2025-04-13 21:38:43,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:38:49,437 INFO L225 Difference]: With dead ends: 759772 [2025-04-13 21:38:49,437 INFO L226 Difference]: Without dead ends: 352883 [2025-04-13 21:38:50,668 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:38:50,669 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:38:50,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 32 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:38:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352883 states.