/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:12:16,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:12:16,351 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 17:12:16,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:12:16,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:12:16,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:12:16,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:12:16,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:12:16,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:12:16,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:12:16,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:12:16,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:12:16,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:12:16,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:12:16,372 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:12:16,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:12:16,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:12:16,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:12:16,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:12:16,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:12:16,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:12:16,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:12:16,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:12:16,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:12:16,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:12:16,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:12:16,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:12:16,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:12:16,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:12:16,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:12:16,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:12:16,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:12:16,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:12:16,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:12:16,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:12:16,374 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 [2025-04-13 17:12:16,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:12:16,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:12:16,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:12:16,586 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:12:16,586 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:12:16,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-04-13 17:12:17,794 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499c70675/02226d4a2a9949ad8a95a718806d7fe2/FLAGfde864db0 [2025-04-13 17:12:18,053 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:12:18,054 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-04-13 17:12:18,063 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499c70675/02226d4a2a9949ad8a95a718806d7fe2/FLAGfde864db0 [2025-04-13 17:12:18,844 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499c70675/02226d4a2a9949ad8a95a718806d7fe2 [2025-04-13 17:12:18,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:12:18,847 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:12:18,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:12:18,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:12:18,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:12:18,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:12:18" (1/1) ... [2025-04-13 17:12:18,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@479a8444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:18, skipping insertion in model container [2025-04-13 17:12:18,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:12:18" (1/1) ... [2025-04-13 17:12:18,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:12:19,135 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/48_ticket_lock_low_contention_vs-pthread.i[30570,30583] [2025-04-13 17:12:19,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:12:19,162 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:12:19,205 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/48_ticket_lock_low_contention_vs-pthread.i[30570,30583] [2025-04-13 17:12:19,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:12:19,229 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:12:19,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19 WrapperNode [2025-04-13 17:12:19,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:12:19,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:12:19,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:12:19,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:12:19,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,252 INFO L138 Inliner]: procedures = 164, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2025-04-13 17:12:19,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:12:19,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:12:19,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:12:19,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:12:19,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,271 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 17:12:19,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,274 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:12:19,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:12:19,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:12:19,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:12:19,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (1/1) ... [2025-04-13 17:12:19,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:12:19,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:12:19,310 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 17:12:19,313 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 17:12:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 17:12:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 17:12:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 17:12:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:12:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:12:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:12:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 17:12:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:12:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:12:19,330 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:12:19,409 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:12:19,411 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:12:19,515 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:12:19,516 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:12:19,516 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:12:19,620 INFO L313 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-13 17:12:19,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:12:19 BoogieIcfgContainer [2025-04-13 17:12:19,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:12:19,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:12:19,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:12:19,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:12:19,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:12:18" (1/3) ... [2025-04-13 17:12:19,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275c2817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:12:19, skipping insertion in model container [2025-04-13 17:12:19,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:12:19" (2/3) ... [2025-04-13 17:12:19,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275c2817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:12:19, skipping insertion in model container [2025-04-13 17:12:19,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:12:19" (3/3) ... [2025-04-13 17:12:19,628 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2025-04-13 17:12:19,638 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:12:19,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-pthread.i that has 2 procedures, 16 locations, 15 edges, 1 initial locations, 1 loop locations, and 2 error locations. [2025-04-13 17:12:19,639 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:12:19,663 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:19,682 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 19 places, 16 transitions, 36 flow [2025-04-13 17:12:19,694 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 60 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 59 states have internal predecessors, (98), 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 17:12:19,709 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:19,716 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;@30a9d2d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:19,716 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 17:12:19,718 INFO L278 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 59 states have internal predecessors, (98), 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 17:12:19,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-13 17:12:19,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:19,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-13 17:12:19,722 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:12:19,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:19,726 INFO L85 PathProgramCache]: Analyzing trace with hash 6211358, now seen corresponding path program 1 times [2025-04-13 17:12:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:19,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793202105] [2025-04-13 17:12:19,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:19,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:19,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 17:12:19,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 17:12:19,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:19,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:19,930 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 17:12:19,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:19,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793202105] [2025-04-13 17:12:19,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793202105] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:19,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:19,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:12:19,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809374000] [2025-04-13 17:12:19,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:19,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:12:19,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:19,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:12:19,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:12:19,949 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 59 states have internal predecessors, (98), 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 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 17:12:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:19,988 INFO L93 Difference]: Finished difference Result 60 states and 98 transitions. [2025-04-13 17:12:19,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:12:19,990 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-04-13 17:12:19,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:19,995 INFO L225 Difference]: With dead ends: 60 [2025-04-13 17:12:19,995 INFO L226 Difference]: Without dead ends: 21 [2025-04-13 17:12:20,014 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:12:20,017 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:20,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:12:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-04-13 17:12:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-04-13 17:12:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 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 17:12:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2025-04-13 17:12:20,045 INFO L79 Accepts]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 4 [2025-04-13 17:12:20,045 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:20,045 INFO L485 AbstractCegarLoop]: Abstraction has 21 states and 30 transitions. [2025-04-13 17:12:20,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 17:12:20,047 INFO L278 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2025-04-13 17:12:20,047 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:12:20,047 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:20,047 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1] [2025-04-13 17:12:20,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:12:20,048 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:12:20,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash 192541616, now seen corresponding path program 1 times [2025-04-13 17:12:20,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:20,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091279227] [2025-04-13 17:12:20,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:20,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:20,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:12:20,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:12:20,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:20,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:20,070 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:12:20,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:12:20,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:12:20,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:20,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:20,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:12:20,098 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:12:20,099 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 17:12:20,100 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 17:12:20,100 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 17:12:20,100 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 17:12:20,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:12:20,102 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 17:12:20,103 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:12:20,103 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 17:12:20,115 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:20,116 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 23 transitions, 56 flow [2025-04-13 17:12:20,154 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 467 states, 452 states have (on average 2.564159292035398) internal successors, (1159), 466 states have internal predecessors, (1159), 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 17:12:20,155 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:20,156 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;@30a9d2d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:20,156 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 17:12:20,158 INFO L278 IsEmpty]: Start isEmpty. Operand has 467 states, 452 states have (on average 2.564159292035398) internal successors, (1159), 466 states have internal predecessors, (1159), 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 17:12:20,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-13 17:12:20,159 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:20,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-13 17:12:20,159 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:12:20,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash 6919390, now seen corresponding path program 1 times [2025-04-13 17:12:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:20,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594125550] [2025-04-13 17:12:20,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:20,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 17:12:20,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 17:12:20,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:20,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:20,213 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 17:12:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:20,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594125550] [2025-04-13 17:12:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594125550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:20,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:12:20,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258742046] [2025-04-13 17:12:20,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:20,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:12:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:20,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:12:20,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:12:20,215 INFO L87 Difference]: Start difference. First operand has 467 states, 452 states have (on average 2.564159292035398) internal successors, (1159), 466 states have internal predecessors, (1159), 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 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 17:12:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:20,261 INFO L93 Difference]: Finished difference Result 467 states and 1159 transitions. [2025-04-13 17:12:20,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:12:20,262 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-04-13 17:12:20,262 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:20,263 INFO L225 Difference]: With dead ends: 467 [2025-04-13 17:12:20,263 INFO L226 Difference]: Without dead ends: 123 [2025-04-13 17:12:20,264 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:12:20,264 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:20,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:12:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-04-13 17:12:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-04-13 17:12:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.2704918032786887) internal successors, (277), 122 states have internal predecessors, (277), 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 17:12:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 277 transitions. [2025-04-13 17:12:20,274 INFO L79 Accepts]: Start accepts. Automaton has 123 states and 277 transitions. Word has length 4 [2025-04-13 17:12:20,274 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:20,274 INFO L485 AbstractCegarLoop]: Abstraction has 123 states and 277 transitions. [2025-04-13 17:12:20,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 17:12:20,274 INFO L278 IsEmpty]: Start isEmpty. Operand 123 states and 277 transitions. [2025-04-13 17:12:20,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 17:12:20,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:20,277 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2025-04-13 17:12:20,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:12:20,277 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 17:12:20,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash -27378995, now seen corresponding path program 1 times [2025-04-13 17:12:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:20,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845538049] [2025-04-13 17:12:20,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:20,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:20,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:12:20,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:12:20,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:20,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:20,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:12:20,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:12:20,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:12:20,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:20,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:20,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:12:20,295 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:12:20,295 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 17:12:20,295 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 17:12:20,295 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 17:12:20,296 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 17:12:20,296 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 17:12:20,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:12:20,296 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 17:12:20,296 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:12:20,296 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 17:12:20,309 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:20,310 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 30 transitions, 78 flow [2025-04-13 17:12:20,399 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3424 states, 3390 states have (on average 3.372566371681416) internal successors, (11433), 3423 states have internal predecessors, (11433), 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 17:12:20,401 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:20,401 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;@30a9d2d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:20,401 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:12:20,410 INFO L278 IsEmpty]: Start isEmpty. Operand has 3424 states, 3390 states have (on average 3.372566371681416) internal successors, (11433), 3423 states have internal predecessors, (11433), 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 17:12:20,411 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-13 17:12:20,411 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:20,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-13 17:12:20,411 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:12:20,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:20,411 INFO L85 PathProgramCache]: Analyzing trace with hash 7842910, now seen corresponding path program 1 times [2025-04-13 17:12:20,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:20,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701734519] [2025-04-13 17:12:20,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:20,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 17:12:20,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 17:12:20,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:20,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:20,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-13 17:12:20,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:20,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701734519] [2025-04-13 17:12:20,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701734519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:20,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:12:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951042987] [2025-04-13 17:12:20,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:20,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:12:20,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:20,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:12:20,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:12:20,493 INFO L87 Difference]: Start difference. First operand has 3424 states, 3390 states have (on average 3.372566371681416) internal successors, (11433), 3423 states have internal predecessors, (11433), 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 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 17:12:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:20,578 INFO L93 Difference]: Finished difference Result 3424 states and 11433 transitions. [2025-04-13 17:12:20,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:12:20,579 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-04-13 17:12:20,579 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:20,593 INFO L225 Difference]: With dead ends: 3424 [2025-04-13 17:12:20,593 INFO L226 Difference]: Without dead ends: 735 [2025-04-13 17:12:20,597 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:12:20,598 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:20,598 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:12:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-04-13 17:12:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2025-04-13 17:12:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 734 states have (on average 3.0912806539509536) internal successors, (2269), 734 states have internal predecessors, (2269), 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 17:12:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 2269 transitions. [2025-04-13 17:12:20,647 INFO L79 Accepts]: Start accepts. Automaton has 735 states and 2269 transitions. Word has length 4 [2025-04-13 17:12:20,647 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:20,647 INFO L485 AbstractCegarLoop]: Abstraction has 735 states and 2269 transitions. [2025-04-13 17:12:20,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 17:12:20,647 INFO L278 IsEmpty]: Start isEmpty. Operand 735 states and 2269 transitions. [2025-04-13 17:12:20,648 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 17:12:20,648 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:20,648 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 17:12:20,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:12:20,648 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:12:20,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:20,648 INFO L85 PathProgramCache]: Analyzing trace with hash 297686654, now seen corresponding path program 1 times [2025-04-13 17:12:20,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:20,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661513835] [2025-04-13 17:12:20,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:20,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:20,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:12:20,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:12:20,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:20,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:20,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:12:20,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:12:20,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:12:20,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:20,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:20,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:12:20,680 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:12:20,680 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 17:12:20,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 17:12:20,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 17:12:20,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 17:12:20,681 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 17:12:20,681 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 17:12:20,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:12:20,681 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 17:12:20,681 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:12:20,681 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 17:12:20,698 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:20,701 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 37 transitions, 102 flow [2025-04-13 17:12:21,322 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24447 states, 24374 states have (on average 4.210716337080496) internal successors, (102632), 24446 states have internal predecessors, (102632), 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 17:12:21,325 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:21,325 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;@30a9d2d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:21,325 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 17:12:21,389 INFO L278 IsEmpty]: Start isEmpty. Operand has 24447 states, 24374 states have (on average 4.210716337080496) internal successors, (102632), 24446 states have internal predecessors, (102632), 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 17:12:21,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-13 17:12:21,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:21,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-13 17:12:21,390 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:12:21,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:21,390 INFO L85 PathProgramCache]: Analyzing trace with hash 8981918, now seen corresponding path program 1 times [2025-04-13 17:12:21,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:21,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095667147] [2025-04-13 17:12:21,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:21,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:21,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 17:12:21,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 17:12:21,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:21,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:21,435 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 17:12:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:21,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095667147] [2025-04-13 17:12:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095667147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:21,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:21,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:12:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650836810] [2025-04-13 17:12:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:21,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:12:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:21,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:12:21,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:12:21,494 INFO L87 Difference]: Start difference. First operand has 24447 states, 24374 states have (on average 4.210716337080496) internal successors, (102632), 24446 states have internal predecessors, (102632), 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 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 17:12:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:21,920 INFO L93 Difference]: Finished difference Result 24447 states and 102632 transitions. [2025-04-13 17:12:21,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:12:21,921 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-04-13 17:12:21,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:22,070 INFO L225 Difference]: With dead ends: 24447 [2025-04-13 17:12:22,070 INFO L226 Difference]: Without dead ends: 4407 [2025-04-13 17:12:22,095 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:12:22,096 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:22,096 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:12:22,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4407 states. [2025-04-13 17:12:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4407 to 4407. [2025-04-13 17:12:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4407 states, 4406 states have (on average 3.922151611438947) internal successors, (17281), 4406 states have internal predecessors, (17281), 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 17:12:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4407 states to 4407 states and 17281 transitions. [2025-04-13 17:12:22,263 INFO L79 Accepts]: Start accepts. Automaton has 4407 states and 17281 transitions. Word has length 4 [2025-04-13 17:12:22,263 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:22,263 INFO L485 AbstractCegarLoop]: Abstraction has 4407 states and 17281 transitions. [2025-04-13 17:12:22,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 17:12:22,263 INFO L278 IsEmpty]: Start isEmpty. Operand 4407 states and 17281 transitions. [2025-04-13 17:12:22,266 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 17:12:22,266 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:22,266 INFO L218 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:22,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:12:22,266 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 17:12:22,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2121717603, now seen corresponding path program 1 times [2025-04-13 17:12:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:22,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739763356] [2025-04-13 17:12:22,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:22,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:12:22,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:12:22,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:22,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:22,280 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:12:22,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:12:22,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:12:22,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:22,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:22,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:12:22,294 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:12:22,294 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 17:12:22,294 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 17:12:22,294 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 17:12:22,294 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 17:12:22,294 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 17:12:22,294 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 17:12:22,294 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 17:12:22,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:12:22,295 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 17:12:22,295 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:12:22,295 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 17:12:22,313 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:22,315 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 44 transitions, 128 flow [2025-04-13 17:12:26,868 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 172580 states, 172428 states have (on average 5.061544528730833) internal successors, (872752), 172579 states have internal predecessors, (872752), 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 17:12:26,870 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:26,871 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;@30a9d2d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:26,871 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 17:12:27,172 INFO L278 IsEmpty]: Start isEmpty. Operand has 172580 states, 172428 states have (on average 5.061544528730833) internal successors, (872752), 172579 states have internal predecessors, (872752), 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 17:12:27,175 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-13 17:12:27,175 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:27,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-13 17:12:27,179 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 17:12:27,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:27,179 INFO L85 PathProgramCache]: Analyzing trace with hash 10336414, now seen corresponding path program 1 times [2025-04-13 17:12:27,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:27,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948182121] [2025-04-13 17:12:27,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:27,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:27,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 17:12:27,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 17:12:27,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:27,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:27,217 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 17:12:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:27,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948182121] [2025-04-13 17:12:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948182121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:27,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:27,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:12:27,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338140107] [2025-04-13 17:12:27,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:27,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:12:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:27,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:12:27,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:12:27,511 INFO L87 Difference]: Start difference. First operand has 172580 states, 172428 states have (on average 5.061544528730833) internal successors, (872752), 172579 states have internal predecessors, (872752), 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 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 17:12:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:30,287 INFO L93 Difference]: Finished difference Result 172580 states and 872752 transitions. [2025-04-13 17:12:30,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:12:30,288 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-04-13 17:12:30,288 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:30,850 INFO L225 Difference]: With dead ends: 172580 [2025-04-13 17:12:30,850 INFO L226 Difference]: Without dead ends: 26439 [2025-04-13 17:12:31,064 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:12:31,065 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:31,065 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:12:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26439 states. [2025-04-13 17:12:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26439 to 26439. [2025-04-13 17:12:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26439 states, 26438 states have (on average 4.755011725546562) internal successors, (125713), 26438 states have internal predecessors, (125713), 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 17:12:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26439 states to 26439 states and 125713 transitions. [2025-04-13 17:12:32,302 INFO L79 Accepts]: Start accepts. Automaton has 26439 states and 125713 transitions. Word has length 4 [2025-04-13 17:12:32,302 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:32,302 INFO L485 AbstractCegarLoop]: Abstraction has 26439 states and 125713 transitions. [2025-04-13 17:12:32,302 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 17:12:32,302 INFO L278 IsEmpty]: Start isEmpty. Operand 26439 states and 125713 transitions. [2025-04-13 17:12:32,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 17:12:32,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:32,304 INFO L218 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:32,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:12:32,304 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 17:12:32,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1855312356, now seen corresponding path program 1 times [2025-04-13 17:12:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:32,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069099287] [2025-04-13 17:12:32,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:32,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 17:12:32,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 17:12:32,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:32,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:32,318 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:12:32,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 17:12:32,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 17:12:32,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:32,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:32,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:12:32,329 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:12:32,329 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-13 17:12:32,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-13 17:12:32,330 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 17:12:32,330 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 17:12:32,330 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 17:12:32,330 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 17:12:32,330 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-13 17:12:32,330 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-13 17:12:32,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 17:12:32,330 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 17:12:32,333 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:12:32,333 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 17:12:32,353 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:32,355 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 51 transitions, 156 flow [2025-04-13 17:13:09,279 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1212427 states, 1212116 states have (on average 5.916985668038373) internal successors, (7172073), 1212426 states have internal predecessors, (7172073), 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 17:13:09,281 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:13:09,281 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;@30a9d2d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:13:09,281 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 17:13:11,674 INFO L278 IsEmpty]: Start isEmpty. Operand has 1212427 states, 1212116 states have (on average 5.916985668038373) internal successors, (7172073), 1212426 states have internal predecessors, (7172073), 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 17:13:11,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-13 17:13:11,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:13:11,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-13 17:13:11,675 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 17:13:11,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:13:11,675 INFO L85 PathProgramCache]: Analyzing trace with hash 11906398, now seen corresponding path program 1 times [2025-04-13 17:13:11,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:13:11,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327142354] [2025-04-13 17:13:11,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:13:11,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:13:11,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 17:13:11,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 17:13:11,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:13:11,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:13:11,698 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 17:13:11,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:13:11,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327142354] [2025-04-13 17:13:11,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327142354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:13:11,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:13:11,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:13:11,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790871704] [2025-04-13 17:13:11,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:13:11,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:13:11,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:13:11,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:13:11,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:13:13,969 INFO L87 Difference]: Start difference. First operand has 1212427 states, 1212116 states have (on average 5.916985668038373) internal successors, (7172073), 1212426 states have internal predecessors, (7172073), 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 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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)