/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 PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:22:00,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:22:00,111 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 20:22:00,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:22:00,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:22:00,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:22:00,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:22:00,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:22:00,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:22:00,143 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:22:00,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:22:00,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:22:00,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:22:00,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:22:00,144 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:22:00,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:22:00,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:22:00,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:22:00,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:22:00,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:22:00,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:22:00,147 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:22:00,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:22:00,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:22:00,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:22:00,383 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:22:00,384 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:22:00,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-04-13 20:22:01,748 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c522ad2/fe756fbe7aa5437eb0eff6dcbe42a9f6/FLAGfe8497a80 [2025-04-13 20:22:01,939 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:22:01,939 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-04-13 20:22:01,950 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c522ad2/fe756fbe7aa5437eb0eff6dcbe42a9f6/FLAGfe8497a80 [2025-04-13 20:22:02,754 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c522ad2/fe756fbe7aa5437eb0eff6dcbe42a9f6 [2025-04-13 20:22:02,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:22:02,758 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:22:02,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:22:02,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:22:02,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:22:02,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:02,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@624b7528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02, skipping insertion in model container [2025-04-13 20:22:02,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:02,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:22:02,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2025-04-13 20:22:02,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:22:02,926 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:22:02,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2025-04-13 20:22:02,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:22:02,956 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:22:02,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02 WrapperNode [2025-04-13 20:22:02,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:22:02,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:22:02,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:22:02,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:22:02,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:02,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:02,984 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 125 [2025-04-13 20:22:02,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:22:02,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:22:02,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:22:02,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:22:02,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:02,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:02,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:03,010 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 20:22:03,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:03,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:03,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:03,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:03,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:03,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:03,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:03,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:22:03,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:22:03,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:22:03,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:22:03,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (1/1) ... [2025-04-13 20:22:03,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:22:03,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:22:03,053 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 20:22:03,054 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 20:22:03,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:22:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:22:03,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:22:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:22:03,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:22:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:22:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:22:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:22:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:22:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:22:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:22:03,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:22:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:22:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:22:03,071 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 20:22:03,132 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:22:03,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:22:03,345 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:22:03,346 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:22:03,346 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:22:03,518 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:22:03,521 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:22:03,525 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:22:03,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:22:03 BoogieIcfgContainer [2025-04-13 20:22:03,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:22:03,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:22:03,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:22:03,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:22:03,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:22:02" (1/3) ... [2025-04-13 20:22:03,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8c23f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:22:03, skipping insertion in model container [2025-04-13 20:22:03,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:22:02" (2/3) ... [2025-04-13 20:22:03,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8c23f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:22:03, skipping insertion in model container [2025-04-13 20:22:03,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:22:03" (3/3) ... [2025-04-13 20:22:03,532 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-04-13 20:22:03,541 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:22:03,542 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 19 locations, 21 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 20:22:03,542 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:22:03,585 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:22:03,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 23 transitions, 60 flow [2025-04-13 20:22:03,641 INFO L116 PetriNetUnfolderBase]: 5/21 cut-off events. [2025-04-13 20:22:03,643 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:22:03,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 5/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-04-13 20:22:03,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 23 transitions, 60 flow [2025-04-13 20:22:03,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 20 transitions, 52 flow [2025-04-13 20:22:03,652 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:22:03,666 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45304314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:22:03,666 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:22:03,672 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:22:03,673 INFO L116 PetriNetUnfolderBase]: 5/19 cut-off events. [2025-04-13 20:22:03,673 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:22:03,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:03,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:03,674 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:22:03,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:03,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1916511004, now seen corresponding path program 1 times [2025-04-13 20:22:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:03,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208011866] [2025-04-13 20:22:03,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:03,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 20:22:03,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 20:22:03,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:03,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:03,858 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 20:22:03,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:03,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208011866] [2025-04-13 20:22:03,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208011866] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:03,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:03,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:22:03,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974695307] [2025-04-13 20:22:03,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:03,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:22:03,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:03,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:22:03,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:22:03,890 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:22:03,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 20:22:03,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:03,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:22:03,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:03,979 INFO L116 PetriNetUnfolderBase]: 106/178 cut-off events. [2025-04-13 20:22:03,979 INFO L117 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-04-13 20:22:03,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 178 events. 106/178 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 524 event pairs, 22 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 324. Up to 126 conditions per place. [2025-04-13 20:22:03,984 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2025-04-13 20:22:03,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2025-04-13 20:22:03,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:22:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:22:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 20:22:03,994 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5507246376811594 [2025-04-13 20:22:03,995 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 52 flow. Second operand 3 states and 38 transitions. [2025-04-13 20:22:03,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2025-04-13 20:22:04,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:22:04,001 INFO L231 Difference]: Finished difference. Result has 21 places, 22 transitions, 63 flow [2025-04-13 20:22:04,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=21, PETRI_TRANSITIONS=22} [2025-04-13 20:22:04,006 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2025-04-13 20:22:04,007 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 22 transitions, 63 flow [2025-04-13 20:22:04,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 20:22:04,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:04,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:04,007 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:22:04,007 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:22:04,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash -158386022, now seen corresponding path program 1 times [2025-04-13 20:22:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:04,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790384374] [2025-04-13 20:22:04,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:04,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:22:04,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:22:04,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:04,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:04,092 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 20:22:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:04,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790384374] [2025-04-13 20:22:04,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790384374] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:04,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:04,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:22:04,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835569707] [2025-04-13 20:22:04,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:04,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:22:04,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:04,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:22:04,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:22:04,094 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-13 20:22:04,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 22 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:04,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:04,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-13 20:22:04,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:04,169 INFO L116 PetriNetUnfolderBase]: 82/159 cut-off events. [2025-04-13 20:22:04,170 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:22:04,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 159 events. 82/159 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 585 event pairs, 34 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 154. Up to 89 conditions per place. [2025-04-13 20:22:04,171 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 24 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2025-04-13 20:22:04,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 34 transitions, 152 flow [2025-04-13 20:22:04,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:22:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:22:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-13 20:22:04,172 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2025-04-13 20:22:04,172 INFO L175 Difference]: Start difference. First operand has 21 places, 22 transitions, 63 flow. Second operand 3 states and 44 transitions. [2025-04-13 20:22:04,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 34 transitions, 152 flow [2025-04-13 20:22:04,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 34 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:22:04,173 INFO L231 Difference]: Finished difference. Result has 23 places, 22 transitions, 70 flow [2025-04-13 20:22:04,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=23, PETRI_TRANSITIONS=22} [2025-04-13 20:22:04,174 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 1 predicate places. [2025-04-13 20:22:04,174 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 22 transitions, 70 flow [2025-04-13 20:22:04,174 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:04,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:04,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:04,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:22:04,174 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:22:04,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash 985244312, now seen corresponding path program 2 times [2025-04-13 20:22:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:04,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211144367] [2025-04-13 20:22:04,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:22:04,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:04,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:22:04,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:22:04,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:22:04,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:04,248 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 20:22:04,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:04,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211144367] [2025-04-13 20:22:04,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211144367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:04,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:04,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:22:04,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135518890] [2025-04-13 20:22:04,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:04,249 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:22:04,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:04,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:22:04,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:22:04,249 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-13 20:22:04,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 22 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:04,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:04,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-13 20:22:04,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:04,329 INFO L116 PetriNetUnfolderBase]: 61/123 cut-off events. [2025-04-13 20:22:04,329 INFO L117 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-04-13 20:22:04,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 123 events. 61/123 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 367 event pairs, 12 based on Foata normal form. 13/116 useless extension candidates. Maximal degree in co-relation 250. Up to 81 conditions per place. [2025-04-13 20:22:04,330 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 19 selfloop transitions, 2 changer transitions 3/28 dead transitions. [2025-04-13 20:22:04,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 136 flow [2025-04-13 20:22:04,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:22:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:22:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 20:22:04,332 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5507246376811594 [2025-04-13 20:22:04,332 INFO L175 Difference]: Start difference. First operand has 23 places, 22 transitions, 70 flow. Second operand 3 states and 38 transitions. [2025-04-13 20:22:04,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 136 flow [2025-04-13 20:22:04,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 132 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:22:04,333 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 76 flow [2025-04-13 20:22:04,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2025-04-13 20:22:04,333 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2025-04-13 20:22:04,333 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 76 flow [2025-04-13 20:22:04,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:04,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:04,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:04,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:22:04,334 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:22:04,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:04,334 INFO L85 PathProgramCache]: Analyzing trace with hash 333278310, now seen corresponding path program 1 times [2025-04-13 20:22:04,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:04,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305339160] [2025-04-13 20:22:04,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:04,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:22:04,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:22:04,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:04,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:22:04,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:04,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305339160] [2025-04-13 20:22:04,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305339160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:04,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:04,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:22:04,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140613894] [2025-04-13 20:22:04,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:04,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:22:04,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:04,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:22:04,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:22:04,428 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-13 20:22:04,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 20:22:04,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:04,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-13 20:22:04,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:04,487 INFO L116 PetriNetUnfolderBase]: 53/110 cut-off events. [2025-04-13 20:22:04,487 INFO L117 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-04-13 20:22:04,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 110 events. 53/110 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 319 event pairs, 27 based on Foata normal form. 6/93 useless extension candidates. Maximal degree in co-relation 169. Up to 89 conditions per place. [2025-04-13 20:22:04,488 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 17 selfloop transitions, 2 changer transitions 5/28 dead transitions. [2025-04-13 20:22:04,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 138 flow [2025-04-13 20:22:04,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:22:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:22:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-13 20:22:04,489 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2025-04-13 20:22:04,489 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 76 flow. Second operand 4 states and 40 transitions. [2025-04-13 20:22:04,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 138 flow [2025-04-13 20:22:04,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 130 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 20:22:04,491 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 84 flow [2025-04-13 20:22:04,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2025-04-13 20:22:04,491 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 6 predicate places. [2025-04-13 20:22:04,491 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 84 flow [2025-04-13 20:22:04,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 20:22:04,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:04,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:04,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:22:04,493 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:22:04,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2114228481, now seen corresponding path program 1 times [2025-04-13 20:22:04,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:04,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491431385] [2025-04-13 20:22:04,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:22:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:04,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:22:04,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:22:04,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:04,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:22:04,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:04,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491431385] [2025-04-13 20:22:04,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491431385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:04,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:04,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:22:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454155578] [2025-04-13 20:22:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:04,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:22:04,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:04,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:22:04,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:22:04,844 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:22:04,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 84 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 20:22:04,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:04,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:22:04,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:05,155 INFO L116 PetriNetUnfolderBase]: 240/410 cut-off events. [2025-04-13 20:22:05,155 INFO L117 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-04-13 20:22:05,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 410 events. 240/410 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1529 event pairs, 11 based on Foata normal form. 2/326 useless extension candidates. Maximal degree in co-relation 971. Up to 161 conditions per place. [2025-04-13 20:22:05,158 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 62 selfloop transitions, 42 changer transitions 2/106 dead transitions. [2025-04-13 20:22:05,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 106 transitions, 520 flow [2025-04-13 20:22:05,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:22:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:22:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 134 transitions. [2025-04-13 20:22:05,161 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3884057971014493 [2025-04-13 20:22:05,161 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 84 flow. Second operand 15 states and 134 transitions. [2025-04-13 20:22:05,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 106 transitions, 520 flow [2025-04-13 20:22:05,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 106 transitions, 512 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-13 20:22:05,163 INFO L231 Difference]: Finished difference. Result has 47 places, 68 transitions, 388 flow [2025-04-13 20:22:05,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=388, PETRI_PLACES=47, PETRI_TRANSITIONS=68} [2025-04-13 20:22:05,163 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 25 predicate places. [2025-04-13 20:22:05,163 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 68 transitions, 388 flow [2025-04-13 20:22:05,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 20:22:05,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:05,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:22:05,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:22:05,164 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:22:05,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:05,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1566311843, now seen corresponding path program 2 times [2025-04-13 20:22:05,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:05,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756462098] [2025-04-13 20:22:05,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:22:05,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:05,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:22:05,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:22:05,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:22:05,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 20:22:05,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 20:22:05,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:22:05,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:22:05,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:22:05,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 20:22:05,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 20:22:05,212 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 20:22:05,213 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 20:22:05,214 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 20:22:05,214 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 20:22:05,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:22:05,214 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-04-13 20:22:05,255 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:22:05,255 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:22:05,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:22:05 BasicIcfg [2025-04-13 20:22:05,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:22:05,259 INFO L158 Benchmark]: Toolchain (without parser) took 2501.27ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 33.8MB in the end (delta: 66.1MB). Peak memory consumption was 65.3MB. Max. memory is 8.0GB. [2025-04-13 20:22:05,259 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:22:05,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.12ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 85.0MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:22:05,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.37ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 82.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:22:05,259 INFO L158 Benchmark]: Boogie Preprocessor took 43.96ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 80.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:22:05,259 INFO L158 Benchmark]: RCFGBuilder took 495.08ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 32.2MB in the end (delta: 48.4MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 20:22:05,260 INFO L158 Benchmark]: TraceAbstraction took 1731.25ms. Allocated memory is still 142.6MB. Free memory was 31.4MB in the beginning and 33.8MB in the end (delta: -2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:22:05,261 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.12ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 85.0MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.37ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 82.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.96ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 80.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 495.08ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 32.2MB in the end (delta: 48.4MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 1731.25ms. Allocated memory is still 142.6MB. Free memory was 31.4MB in the beginning and 33.8MB in the end (delta: -2.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 78]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \at(size, Pre)=1, arr={-3:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \at(size, Pre)=1, arr={-3:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, N=1, counter=0, t1=-5] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, N=1, counter=0, t1=-5, t2=-4] [L48] 1 int i=0; [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L57] 2 int i=0; [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-3:0}, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=6, i=0, tmp=6] [L48] 1 i++ [L48] COND FALSE 1 !(i