/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:59:44,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:59:44,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:59:44,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:59:44,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:59:44,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:59:44,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:59:44,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:59:44,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:59:44,184 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:59:44,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:59:44,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:59:44,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:59:44,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:59:44,184 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:59:44,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:59:44,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:59:44,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:59:44,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:59:44,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:59:44,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:59:44,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:59:44,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:59:44,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:59:44,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:59:44,186 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:59:44,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:59:44,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:59:44,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:59:44,427 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:59:44,429 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:59:44,430 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-14 00:59:45,714 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7b436e44/5382317dfa59411f8e0cfdec2bafc9c3/FLAGa4f5b3d99 [2025-04-14 00:59:45,907 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:59:45,907 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-04-14 00:59:45,915 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7b436e44/5382317dfa59411f8e0cfdec2bafc9c3/FLAGa4f5b3d99 [2025-04-14 00:59:46,765 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7b436e44/5382317dfa59411f8e0cfdec2bafc9c3 [2025-04-14 00:59:46,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:59:46,768 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:59:46,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:59:46,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:59:46,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:59:46,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:59:46" (1/1) ... [2025-04-14 00:59:46,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16005dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:46, skipping insertion in model container [2025-04-14 00:59:46,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:59:46" (1/1) ... [2025-04-14 00:59:46,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:59:46,958 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-14 00:59:46,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:59:46,980 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:59:47,005 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-14 00:59:47,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:59:47,027 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:59:47,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47 WrapperNode [2025-04-14 00:59:47,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:59:47,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:59:47,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:59:47,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:59:47,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,064 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 125 [2025-04-14 00:59:47,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:59:47,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:59:47,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:59:47,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:59:47,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,089 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-14 00:59:47,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:59:47,101 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:59:47,101 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:59:47,101 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:59:47,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (1/1) ... [2025-04-14 00:59:47,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:59:47,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:59:47,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:59:47,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:59:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:59:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:59:47,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:59:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:59:47,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:59:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:59:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:59:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:59:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:59:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:59:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:59:47,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:59:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:59:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:59:47,143 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:59:47,208 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:59:47,209 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:59:47,416 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:59:47,416 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:59:47,416 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:59:47,627 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:59:47,652 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:59:47,658 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:59:47,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:59:47 BoogieIcfgContainer [2025-04-14 00:59:47,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:59:47,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:59:47,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:59:47,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:59:47,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:59:46" (1/3) ... [2025-04-14 00:59:47,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a4cb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:59:47, skipping insertion in model container [2025-04-14 00:59:47,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:59:47" (2/3) ... [2025-04-14 00:59:47,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a4cb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:59:47, skipping insertion in model container [2025-04-14 00:59:47,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:59:47" (3/3) ... [2025-04-14 00:59:47,665 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-04-14 00:59:47,676 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:59:47,677 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-14 00:59:47,678 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:59:47,722 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:59:47,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 23 transitions, 60 flow [2025-04-14 00:59:47,770 INFO L116 PetriNetUnfolderBase]: 5/21 cut-off events. [2025-04-14 00:59:47,776 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:59:47,778 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 4. Compared 22 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-14 00:59:47,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 23 transitions, 60 flow [2025-04-14 00:59:47,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 20 transitions, 52 flow [2025-04-14 00:59:47,786 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:59:47,794 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;@2ba563c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:59:47,795 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:59:47,802 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:59:47,803 INFO L116 PetriNetUnfolderBase]: 5/19 cut-off events. [2025-04-14 00:59:47,803 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:59:47,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:47,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:47,803 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:59:47,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash 188298092, now seen corresponding path program 1 times [2025-04-14 00:59:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:47,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66366136] [2025-04-14 00:59:47,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:47,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:47,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 00:59:47,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:59:47,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:47,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:59:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:47,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66366136] [2025-04-14 00:59:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66366136] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:47,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:59:47,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787770940] [2025-04-14 00:59:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:47,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:59:47,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:48,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:59:48,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:59:48,008 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:59:48,010 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-14 00:59:48,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:48,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:59:48,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:48,116 INFO L116 PetriNetUnfolderBase]: 106/178 cut-off events. [2025-04-14 00:59:48,116 INFO L117 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-04-14 00:59:48,117 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 521 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-14 00:59:48,119 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2025-04-14 00:59:48,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2025-04-14 00:59:48,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:59:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:59:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-14 00:59:48,130 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5507246376811594 [2025-04-14 00:59:48,131 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 52 flow. Second operand 3 states and 38 transitions. [2025-04-14 00:59:48,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2025-04-14 00:59:48,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:59:48,137 INFO L231 Difference]: Finished difference. Result has 21 places, 22 transitions, 63 flow [2025-04-14 00:59:48,139 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-14 00:59:48,141 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2025-04-14 00:59:48,142 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 22 transitions, 63 flow [2025-04-14 00:59:48,142 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-14 00:59:48,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:48,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:48,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:59:48,143 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:59:48,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1131176852, now seen corresponding path program 1 times [2025-04-14 00:59:48,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:48,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050653291] [2025-04-14 00:59:48,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:48,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 00:59:48,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:59:48,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:48,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:59:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:48,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050653291] [2025-04-14 00:59:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050653291] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:48,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:48,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:59:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654432027] [2025-04-14 00:59:48,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:48,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:59:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:48,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:59:48,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:59:48,226 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:59:48,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 22 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:48,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:48,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:59:48,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:48,346 INFO L116 PetriNetUnfolderBase]: 111/198 cut-off events. [2025-04-14 00:59:48,346 INFO L117 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-04-14 00:59:48,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 198 events. 111/198 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 655 event pairs, 46 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 180. Up to 130 conditions per place. [2025-04-14 00:59:48,348 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 32 selfloop transitions, 2 changer transitions 4/38 dead transitions. [2025-04-14 00:59:48,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 38 transitions, 186 flow [2025-04-14 00:59:48,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:59:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:59:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-14 00:59:48,350 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2025-04-14 00:59:48,350 INFO L175 Difference]: Start difference. First operand has 21 places, 22 transitions, 63 flow. Second operand 3 states and 42 transitions. [2025-04-14 00:59:48,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 38 transitions, 186 flow [2025-04-14 00:59:48,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 38 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:59:48,351 INFO L231 Difference]: Finished difference. Result has 23 places, 22 transitions, 70 flow [2025-04-14 00:59:48,351 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-14 00:59:48,351 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 1 predicate places. [2025-04-14 00:59:48,351 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 22 transitions, 70 flow [2025-04-14 00:59:48,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:48,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:48,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:48,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:59:48,352 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:59:48,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:48,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1792758004, now seen corresponding path program 2 times [2025-04-14 00:59:48,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:48,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817342181] [2025-04-14 00:59:48,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:59:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:48,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-04-14 00:59:48,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 00:59:48,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:59:48,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:59:48,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:48,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817342181] [2025-04-14 00:59:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817342181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:48,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:59:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93503490] [2025-04-14 00:59:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:48,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:59:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:48,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:59:48,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:59:48,436 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:59:48,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 22 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:48,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:48,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:59:48,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:48,496 INFO L116 PetriNetUnfolderBase]: 77/140 cut-off events. [2025-04-14 00:59:48,496 INFO L117 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-04-14 00:59:48,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 140 events. 77/140 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 368 event pairs, 17 based on Foata normal form. 17/137 useless extension candidates. Maximal degree in co-relation 318. Up to 122 conditions per place. [2025-04-14 00:59:48,497 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 23 selfloop transitions, 2 changer transitions 3/28 dead transitions. [2025-04-14 00:59:48,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 144 flow [2025-04-14 00:59:48,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:59:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:59:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-14 00:59:48,498 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2025-04-14 00:59:48,498 INFO L175 Difference]: Start difference. First operand has 23 places, 22 transitions, 70 flow. Second operand 3 states and 34 transitions. [2025-04-14 00:59:48,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 144 flow [2025-04-14 00:59:48,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 140 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:59:48,501 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 76 flow [2025-04-14 00:59:48,501 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-14 00:59:48,501 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2025-04-14 00:59:48,501 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 76 flow [2025-04-14 00:59:48,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:48,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:48,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:48,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:59:48,502 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:59:48,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:48,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1392047422, now seen corresponding path program 1 times [2025-04-14 00:59:48,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:48,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22351707] [2025-04-14 00:59:48,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:48,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:48,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:59:48,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:59:48,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:48,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:59:48,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:48,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22351707] [2025-04-14 00:59:48,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22351707] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:48,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:48,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:59:48,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929419056] [2025-04-14 00:59:48,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:48,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:59:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:48,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:59:48,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:59:48,636 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:59:48,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:48,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:48,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:59:48,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:48,697 INFO L116 PetriNetUnfolderBase]: 73/135 cut-off events. [2025-04-14 00:59:48,697 INFO L117 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-04-14 00:59:48,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 135 events. 73/135 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 329 event pairs, 39 based on Foata normal form. 6/120 useless extension candidates. Maximal degree in co-relation 221. Up to 130 conditions per place. [2025-04-14 00:59:48,698 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 21 selfloop transitions, 2 changer transitions 5/28 dead transitions. [2025-04-14 00:59:48,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 146 flow [2025-04-14 00:59:48,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:59:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:59:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-04-14 00:59:48,700 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2025-04-14 00:59:48,700 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 76 flow. Second operand 4 states and 34 transitions. [2025-04-14 00:59:48,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 146 flow [2025-04-14 00:59:48,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 138 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-14 00:59:48,701 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 84 flow [2025-04-14 00:59:48,701 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-14 00:59:48,702 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 6 predicate places. [2025-04-14 00:59:48,702 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 84 flow [2025-04-14 00:59:48,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:48,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:48,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:48,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:59:48,702 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:59:48,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1860903463, now seen corresponding path program 1 times [2025-04-14 00:59:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:48,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421187047] [2025-04-14 00:59:48,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:48,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:48,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:59:48,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:59:48,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:48,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:59:49,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:49,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421187047] [2025-04-14 00:59:49,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421187047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:59:49,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849722105] [2025-04-14 00:59:49,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:59:49,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:59:49,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:59:49,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:59:49,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:59:49,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:59:49,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:59:49,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:49,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:49,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:59:49,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:59:49,264 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-14 00:59:49,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:59:49,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849722105] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:49,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:59:49,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-04-14 00:59:49,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525289038] [2025-04-14 00:59:49,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:49,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:59:49,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:49,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:59:49,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:59:49,266 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:59:49,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:49,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:49,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:59:49,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:49,486 INFO L116 PetriNetUnfolderBase]: 225/379 cut-off events. [2025-04-14 00:59:49,486 INFO L117 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-04-14 00:59:49,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 379 events. 225/379 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1389 event pairs, 13 based on Foata normal form. 1/299 useless extension candidates. Maximal degree in co-relation 898. Up to 152 conditions per place. [2025-04-14 00:59:49,488 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 59 selfloop transitions, 36 changer transitions 1/96 dead transitions. [2025-04-14 00:59:49,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 96 transitions, 471 flow [2025-04-14 00:59:49,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:59:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:59:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2025-04-14 00:59:49,493 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42391304347826086 [2025-04-14 00:59:49,493 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 84 flow. Second operand 12 states and 117 transitions. [2025-04-14 00:59:49,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 96 transitions, 471 flow [2025-04-14 00:59:49,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 96 transitions, 463 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 00:59:49,495 INFO L231 Difference]: Finished difference. Result has 42 places, 63 transitions, 346 flow [2025-04-14 00:59:49,495 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=346, PETRI_PLACES=42, PETRI_TRANSITIONS=63} [2025-04-14 00:59:49,495 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 20 predicate places. [2025-04-14 00:59:49,495 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 63 transitions, 346 flow [2025-04-14 00:59:49,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:49,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:49,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:59:49,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 00:59:49,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:59:49,696 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:59:49,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:49,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1920328089, now seen corresponding path program 2 times [2025-04-14 00:59:49,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:49,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818475918] [2025-04-14 00:59:49,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:59:49,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:49,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-14 00:59:49,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:59:49,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:59:49,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:59:49,716 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:59:49,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:59:49,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:59:49,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:59:49,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:59:49,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:59:49,747 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:59:49,748 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 00:59:49,749 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 00:59:49,749 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 00:59:49,749 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:59:49,749 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-04-14 00:59:49,794 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:59:49,794 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:59:49,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:59:49 BasicIcfg [2025-04-14 00:59:49,799 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:59:49,800 INFO L158 Benchmark]: Toolchain (without parser) took 3031.49ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 33.6MB in the end (delta: 53.5MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. [2025-04-14 00:59:49,800 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:59:49,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.30ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 71.9MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:59:49,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 125.8MB. Free memory was 71.9MB in the beginning and 70.3MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:59:49,801 INFO L158 Benchmark]: Boogie Preprocessor took 34.88ms. Allocated memory is still 125.8MB. Free memory was 69.7MB in the beginning and 68.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:59:49,801 INFO L158 Benchmark]: IcfgBuilder took 557.49ms. Allocated memory is still 125.8MB. Free memory was 68.4MB in the beginning and 84.8MB in the end (delta: -16.4MB). Peak memory consumption was 56.1MB. Max. memory is 8.0GB. [2025-04-14 00:59:49,801 INFO L158 Benchmark]: TraceAbstraction took 2139.00ms. Allocated memory is still 125.8MB. Free memory was 84.2MB in the beginning and 33.6MB in the end (delta: 50.6MB). Peak memory consumption was 49.8MB. Max. memory is 8.0GB. [2025-04-14 00:59:49,802 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.19ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.30ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 71.9MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 125.8MB. Free memory was 71.9MB in the beginning and 70.3MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.88ms. Allocated memory is still 125.8MB. Free memory was 69.7MB in the beginning and 68.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 557.49ms. Allocated memory is still 125.8MB. Free memory was 68.4MB in the beginning and 84.8MB in the end (delta: -16.4MB). Peak memory consumption was 56.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2139.00ms. Allocated memory is still 125.8MB. Free memory was 84.2MB in the beginning and 33.6MB in the end (delta: 50.6MB). Peak memory consumption was 49.8MB. 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=-2] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, N=1, counter=0, t1=-2, t2=-1] [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