./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:03:57,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:03:58,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:03:58,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:03:58,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:03:58,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:03:58,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:03:58,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:03:58,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:03:58,056 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:03:58,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:03:58,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:03:58,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:03:58,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:03:58,057 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:03:58,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:03:58,058 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:03:58,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:03:58,058 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:03:58,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:03:58,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:03:58,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:03:58,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:03:58,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:03:58,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:03:58,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:03:58,059 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2025-03-04 02:03:58,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:03:58,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:03:58,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:03:58,268 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:03:58,268 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:03:58,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-03-04 02:03:59,359 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba8350e1/35301079850840da8b00a2e8d7fb110c/FLAGb4b034e0a [2025-03-04 02:03:59,590 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:03:59,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-03-04 02:03:59,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba8350e1/35301079850840da8b00a2e8d7fb110c/FLAGb4b034e0a [2025-03-04 02:03:59,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba8350e1/35301079850840da8b00a2e8d7fb110c [2025-03-04 02:03:59,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:03:59,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:03:59,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:03:59,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:03:59,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:03:59,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:03:59" (1/1) ... [2025-03-04 02:03:59,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fc2296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:03:59, skipping insertion in model container [2025-03-04 02:03:59,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:03:59" (1/1) ... [2025-03-04 02:03:59,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:04:00,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i[30633,30646] [2025-03-04 02:04:00,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:04:00,185 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:04:00,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i[30633,30646] [2025-03-04 02:04:00,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:04:00,245 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:04:00,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00 WrapperNode [2025-03-04 02:04:00,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:04:00,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:04:00,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:04:00,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:04:00,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,275 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2025-03-04 02:04:00,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:04:00,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:04:00,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:04:00,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:04:00,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,287 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:04:00,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:04:00,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:04:00,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:04:00,292 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:04:00,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (1/1) ... [2025-03-04 02:04:00,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:04:00,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:04:00,313 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-03-04 02:04:00,315 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-03-04 02:04:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 02:04:00,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 02:04:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:04:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:04:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:04:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:04:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:04:00,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:04:00,331 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:04:00,410 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:04:00,411 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:04:00,470 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:04:00,470 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:04:00,511 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:04:00,512 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:04:00,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:04:00 BoogieIcfgContainer [2025-03-04 02:04:00,512 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:04:00,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:04:00,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:04:00,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:04:00,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:03:59" (1/3) ... [2025-03-04 02:04:00,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a963d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:04:00, skipping insertion in model container [2025-03-04 02:04:00,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:04:00" (2/3) ... [2025-03-04 02:04:00,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a963d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:04:00, skipping insertion in model container [2025-03-04 02:04:00,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:04:00" (3/3) ... [2025-03-04 02:04:00,520 INFO L128 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2025-03-04 02:04:00,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:04:00,531 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 45_monabsex1_vs.i that has 2 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 02:04:00,532 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:04:00,552 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:04:00,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 10 transitions, 24 flow [2025-03-04 02:04:00,593 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 02:04:00,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:04:00,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 12 events. 0/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 02:04:00,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 13 places, 10 transitions, 24 flow [2025-03-04 02:04:00,604 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 13 places, 10 transitions, 24 flow [2025-03-04 02:04:00,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:04:00,624 INFO L333 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;@5014f02a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:04:00,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:04:00,630 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:04:00,631 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-04 02:04:00,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:04:00,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:00,633 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 02:04:00,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:04:00,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash 96548345, now seen corresponding path program 1 times [2025-03-04 02:04:00,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:00,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173615686] [2025-03-04 02:04:00,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:00,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:00,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 02:04:00,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 02:04:00,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:00,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:04:00,717 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:04:00,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 02:04:00,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 02:04:00,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:00,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:04:00,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:04:00,741 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:04:00,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-04 02:04:00,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-04 02:04:00,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-04 02:04:00,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:04:00,744 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-04 02:04:00,748 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:04:00,748 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 02:04:00,763 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:04:00,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 42 flow [2025-03-04 02:04:00,769 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 02:04:00,770 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:04:00,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 20 events. 0/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-03-04 02:04:00,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 16 transitions, 42 flow [2025-03-04 02:04:00,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 42 flow [2025-03-04 02:04:00,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:04:00,771 INFO L333 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;@5014f02a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:04:00,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:04:00,774 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:04:00,774 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 02:04:00,775 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:04:00,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:00,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:04:00,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 02:04:00,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:00,775 INFO L85 PathProgramCache]: Analyzing trace with hash -828475583, now seen corresponding path program 1 times [2025-03-04 02:04:00,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:00,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339294383] [2025-03-04 02:04:00,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:00,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:00,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:04:00,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:04:00,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:00,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:04:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:04:00,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:04:00,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339294383] [2025-03-04 02:04:00,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339294383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:04:00,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:04:00,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:04:00,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862764751] [2025-03-04 02:04:00,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:04:00,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:04:00,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:04:00,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:04:00,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:04:00,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2025-03-04 02:04:00,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 16 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-03-04 02:04:00,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:04:00,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2025-03-04 02:04:00,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:04:00,946 INFO L124 PetriNetUnfolderBase]: 109/215 cut-off events. [2025-03-04 02:04:00,946 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 02:04:00,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 215 events. 109/215 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 798 event pairs, 45 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 328. Up to 116 conditions per place. [2025-03-04 02:04:00,950 INFO L140 encePairwiseOnDemand]: 11/16 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2025-03-04 02:04:00,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 109 flow [2025-03-04 02:04:00,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:04:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:04:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-03-04 02:04:00,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-04 02:04:00,963 INFO L175 Difference]: Start difference. First operand has 21 places, 16 transitions, 42 flow. Second operand 3 states and 29 transitions. [2025-03-04 02:04:00,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 109 flow [2025-03-04 02:04:00,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 109 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:04:00,968 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 62 flow [2025-03-04 02:04:00,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2025-03-04 02:04:00,974 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2025-03-04 02:04:00,974 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 62 flow [2025-03-04 02:04:00,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-03-04 02:04:00,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:00,974 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2025-03-04 02:04:00,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:04:00,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 02:04:00,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 86798115, now seen corresponding path program 1 times [2025-03-04 02:04:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:00,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018011070] [2025-03-04 02:04:00,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:01,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 02:04:01,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 02:04:01,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:01,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:04:01,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:04:01,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 02:04:01,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 02:04:01,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:01,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:04:01,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:04:01,017 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:04:01,017 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-04 02:04:01,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-04 02:04:01,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-04 02:04:01,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-04 02:04:01,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:04:01,018 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 02:04:01,018 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:04:01,018 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 02:04:01,034 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:04:01,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 62 flow [2025-03-04 02:04:01,041 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-03-04 02:04:01,041 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:04:01,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 0/28 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-03-04 02:04:01,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 22 transitions, 62 flow [2025-03-04 02:04:01,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-03-04 02:04:01,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:04:01,043 INFO L333 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;@5014f02a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:04:01,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:04:01,045 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:04:01,045 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 02:04:01,045 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:04:01,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:01,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:04:01,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:04:01,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:01,047 INFO L85 PathProgramCache]: Analyzing trace with hash -177490596, now seen corresponding path program 1 times [2025-03-04 02:04:01,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:01,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144805835] [2025-03-04 02:04:01,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:01,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:04:01,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:04:01,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:01,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:04:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:04:01,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:04:01,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144805835] [2025-03-04 02:04:01,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144805835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:04:01,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:04:01,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:04:01,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398274069] [2025-03-04 02:04:01,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:04:01,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:04:01,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:04:01,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:04:01,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:04:01,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2025-03-04 02:04:01,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-03-04 02:04:01,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:04:01,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2025-03-04 02:04:01,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:04:01,278 INFO L124 PetriNetUnfolderBase]: 1343/2070 cut-off events. [2025-03-04 02:04:01,278 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-04 02:04:01,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 2070 events. 1343/2070 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10039 event pairs, 681 based on Foata normal form. 0/1764 useless extension candidates. Maximal degree in co-relation 2280. Up to 1272 conditions per place. [2025-03-04 02:04:01,290 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2025-03-04 02:04:01,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 172 flow [2025-03-04 02:04:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:04:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:04:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-03-04 02:04:01,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-03-04 02:04:01,291 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 3 states and 41 transitions. [2025-03-04 02:04:01,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 172 flow [2025-03-04 02:04:01,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 168 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 02:04:01,293 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 88 flow [2025-03-04 02:04:01,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-03-04 02:04:01,294 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2025-03-04 02:04:01,295 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 88 flow [2025-03-04 02:04:01,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-03-04 02:04:01,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:01,295 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 02:04:01,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:04:01,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:04:01,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:01,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1222252108, now seen corresponding path program 1 times [2025-03-04 02:04:01,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:01,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071154887] [2025-03-04 02:04:01,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:01,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:01,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:04:01,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:04:01,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:01,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:04:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:04:01,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:04:01,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071154887] [2025-03-04 02:04:01,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071154887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:04:01,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:04:01,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:04:01,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346322377] [2025-03-04 02:04:01,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:04:01,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:04:01,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:04:01,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:04:01,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:04:01,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2025-03-04 02:04:01,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-04 02:04:01,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:04:01,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2025-03-04 02:04:01,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:04:01,545 INFO L124 PetriNetUnfolderBase]: 1689/2637 cut-off events. [2025-03-04 02:04:01,545 INFO L125 PetriNetUnfolderBase]: For 1047/1047 co-relation queries the response was YES. [2025-03-04 02:04:01,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6318 conditions, 2637 events. 1689/2637 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13581 event pairs, 787 based on Foata normal form. 0/2387 useless extension candidates. Maximal degree in co-relation 5575. Up to 1546 conditions per place. [2025-03-04 02:04:01,558 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 33 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2025-03-04 02:04:01,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 221 flow [2025-03-04 02:04:01,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:04:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:04:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-03-04 02:04:01,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-03-04 02:04:01,561 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 88 flow. Second operand 3 states and 38 transitions. [2025-03-04 02:04:01,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 221 flow [2025-03-04 02:04:01,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:04:01,567 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 128 flow [2025-03-04 02:04:01,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2025-03-04 02:04:01,568 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2025-03-04 02:04:01,568 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 128 flow [2025-03-04 02:04:01,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-04 02:04:01,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:01,568 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-03-04 02:04:01,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:04:01,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:04:01,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash -765301026, now seen corresponding path program 1 times [2025-03-04 02:04:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:01,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627543610] [2025-03-04 02:04:01,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:01,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:04:01,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:04:01,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:01,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:04:01,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:04:01,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:04:01,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:04:01,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:01,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:04:01,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:04:01,604 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:04:01,604 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 02:04:01,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-04 02:04:01,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-04 02:04:01,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-04 02:04:01,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-04 02:04:01,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:04:01,605 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 02:04:01,605 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:04:01,605 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 02:04:01,622 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:04:01,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 84 flow [2025-03-04 02:04:01,628 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-03-04 02:04:01,628 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 02:04:01,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 36 events. 0/36 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-03-04 02:04:01,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 28 transitions, 84 flow [2025-03-04 02:04:01,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 28 transitions, 84 flow [2025-03-04 02:04:01,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:04:01,630 INFO L333 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;@5014f02a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:04:01,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:04:01,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:04:01,633 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 02:04:01,633 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:04:01,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:01,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:04:01,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:04:01,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:01,634 INFO L85 PathProgramCache]: Analyzing trace with hash 651000092, now seen corresponding path program 1 times [2025-03-04 02:04:01,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:01,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624065681] [2025-03-04 02:04:01,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:01,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:01,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:04:01,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:04:01,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:01,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:04:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:04:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:04:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624065681] [2025-03-04 02:04:01,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624065681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:04:01,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:04:01,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:04:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512142520] [2025-03-04 02:04:01,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:04:01,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:04:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:04:01,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:04:01,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:04:01,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-03-04 02:04:01,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-03-04 02:04:01,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:04:01,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-03-04 02:04:01,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:04:02,476 INFO L124 PetriNetUnfolderBase]: 12243/16840 cut-off events. [2025-03-04 02:04:02,477 INFO L125 PetriNetUnfolderBase]: For 3653/3653 co-relation queries the response was YES. [2025-03-04 02:04:02,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35374 conditions, 16840 events. 12243/16840 cut-off events. For 3653/3653 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 90109 event pairs, 6745 based on Foata normal form. 0/14174 useless extension candidates. Maximal degree in co-relation 5360. Up to 10936 conditions per place. [2025-03-04 02:04:02,572 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-03-04 02:04:02,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 239 flow [2025-03-04 02:04:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:04:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:04:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-03-04 02:04:02,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-03-04 02:04:02,574 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 84 flow. Second operand 3 states and 53 transitions. [2025-03-04 02:04:02,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 239 flow [2025-03-04 02:04:02,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 227 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 02:04:02,577 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 114 flow [2025-03-04 02:04:02,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-03-04 02:04:02,580 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2025-03-04 02:04:02,580 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 114 flow [2025-03-04 02:04:02,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-03-04 02:04:02,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:02,580 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 02:04:02,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:04:02,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:04:02,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1466730329, now seen corresponding path program 1 times [2025-03-04 02:04:02,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:02,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830183445] [2025-03-04 02:04:02,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:02,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:02,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:04:02,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:04:02,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:02,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:04:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:04:02,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:04:02,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830183445] [2025-03-04 02:04:02,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830183445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:04:02,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:04:02,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:04:02,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216931314] [2025-03-04 02:04:02,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:04:02,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:04:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:04:02,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:04:02,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:04:02,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-03-04 02:04:02,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-04 02:04:02,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:04:02,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-03-04 02:04:02,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:04:03,709 INFO L124 PetriNetUnfolderBase]: 16953/23450 cut-off events. [2025-03-04 02:04:03,709 INFO L125 PetriNetUnfolderBase]: For 9851/9851 co-relation queries the response was YES. [2025-03-04 02:04:03,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55876 conditions, 23450 events. 16953/23450 cut-off events. For 9851/9851 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 133504 event pairs, 8455 based on Foata normal form. 0/20680 useless extension candidates. Maximal degree in co-relation 49761. Up to 15062 conditions per place. [2025-03-04 02:04:03,969 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 45 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-03-04 02:04:03,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 300 flow [2025-03-04 02:04:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:04:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:04:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-04 02:04:03,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-04 02:04:03,971 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 114 flow. Second operand 3 states and 50 transitions. [2025-03-04 02:04:03,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 300 flow [2025-03-04 02:04:04,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:04:04,009 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 172 flow [2025-03-04 02:04:04,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-04 02:04:04,009 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2025-03-04 02:04:04,009 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 172 flow [2025-03-04 02:04:04,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-04 02:04:04,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:04,010 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:04:04,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:04:04,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:04:04,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash -795923075, now seen corresponding path program 1 times [2025-03-04 02:04:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:04,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767533510] [2025-03-04 02:04:04,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:04,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:04,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:04:04,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:04:04,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:04,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:04:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:04:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:04:04,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767533510] [2025-03-04 02:04:04,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767533510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:04:04,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:04:04,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:04:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777534710] [2025-03-04 02:04:04,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:04:04,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:04:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:04:04,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:04:04,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:04:04,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-03-04 02:04:04,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-03-04 02:04:04,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:04:04,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-03-04 02:04:04,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:04:05,240 INFO L124 PetriNetUnfolderBase]: 22305/31049 cut-off events. [2025-03-04 02:04:05,240 INFO L125 PetriNetUnfolderBase]: For 20707/20707 co-relation queries the response was YES. [2025-03-04 02:04:05,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79820 conditions, 31049 events. 22305/31049 cut-off events. For 20707/20707 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 185261 event pairs, 10801 based on Foata normal form. 0/27827 useless extension candidates. Maximal degree in co-relation 71245. Up to 19502 conditions per place. [2025-03-04 02:04:05,435 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 49 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2025-03-04 02:04:05,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 409 flow [2025-03-04 02:04:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:04:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:04:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-04 02:04:05,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 02:04:05,436 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 172 flow. Second operand 3 states and 49 transitions. [2025-03-04 02:04:05,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 409 flow [2025-03-04 02:04:05,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:04:05,495 INFO L231 Difference]: Finished difference. Result has 44 places, 46 transitions, 278 flow [2025-03-04 02:04:05,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=44, PETRI_TRANSITIONS=46} [2025-03-04 02:04:05,495 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2025-03-04 02:04:05,496 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 278 flow [2025-03-04 02:04:05,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-03-04 02:04:05,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:05,496 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:04:05,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:04:05,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:04:05,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1115803943, now seen corresponding path program 1 times [2025-03-04 02:04:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:05,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204731185] [2025-03-04 02:04:05,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:05,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:05,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:04:05,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:04:05,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:05,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:04:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:04:05,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:04:05,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204731185] [2025-03-04 02:04:05,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204731185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:04:05,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:04:05,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:04:05,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790339368] [2025-03-04 02:04:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:04:05,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:04:05,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:04:05,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:04:05,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:04:05,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-03-04 02:04:05,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-03-04 02:04:05,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:04:05,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-03-04 02:04:05,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:04:07,943 INFO L124 PetriNetUnfolderBase]: 38199/53543 cut-off events. [2025-03-04 02:04:07,944 INFO L125 PetriNetUnfolderBase]: For 51743/51743 co-relation queries the response was YES. [2025-03-04 02:04:08,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150159 conditions, 53543 events. 38199/53543 cut-off events. For 51743/51743 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 356884 event pairs, 6385 based on Foata normal form. 0/48341 useless extension candidates. Maximal degree in co-relation 150074. Up to 16776 conditions per place. [2025-03-04 02:04:08,229 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 113 selfloop transitions, 33 changer transitions 0/147 dead transitions. [2025-03-04 02:04:08,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 147 transitions, 1084 flow [2025-03-04 02:04:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:04:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:04:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-03-04 02:04:08,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-03-04 02:04:08,233 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 278 flow. Second operand 6 states and 114 transitions. [2025-03-04 02:04:08,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 147 transitions, 1084 flow [2025-03-04 02:04:08,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 147 transitions, 1016 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:04:08,379 INFO L231 Difference]: Finished difference. Result has 51 places, 70 transitions, 575 flow [2025-03-04 02:04:08,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=51, PETRI_TRANSITIONS=70} [2025-03-04 02:04:08,380 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2025-03-04 02:04:08,380 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 70 transitions, 575 flow [2025-03-04 02:04:08,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-03-04 02:04:08,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:08,380 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:04:08,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:04:08,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:04:08,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash -778752413, now seen corresponding path program 2 times [2025-03-04 02:04:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971341726] [2025-03-04 02:04:08,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:04:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:08,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:04:08,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:04:08,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:04:08,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:04:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:04:08,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:04:08,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971341726] [2025-03-04 02:04:08,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971341726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:04:08,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:04:08,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:04:08,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129272034] [2025-03-04 02:04:08,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:04:08,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:04:08,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:04:08,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:04:08,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:04:08,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-03-04 02:04:08,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 70 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-03-04 02:04:08,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:04:08,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-03-04 02:04:08,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:04:11,445 INFO L124 PetriNetUnfolderBase]: 41715/58936 cut-off events. [2025-03-04 02:04:11,445 INFO L125 PetriNetUnfolderBase]: For 95225/95225 co-relation queries the response was YES. [2025-03-04 02:04:11,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183311 conditions, 58936 events. 41715/58936 cut-off events. For 95225/95225 co-relation queries the response was YES. Maximal size of possible extension queue 2587. Compared 405023 event pairs, 5243 based on Foata normal form. 740/55052 useless extension candidates. Maximal degree in co-relation 96155. Up to 19534 conditions per place. [2025-03-04 02:04:11,779 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 128 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2025-03-04 02:04:11,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 179 transitions, 1515 flow [2025-03-04 02:04:11,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:04:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:04:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-03-04 02:04:11,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2025-03-04 02:04:11,782 INFO L175 Difference]: Start difference. First operand has 51 places, 70 transitions, 575 flow. Second operand 7 states and 128 transitions. [2025-03-04 02:04:11,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 179 transitions, 1515 flow [2025-03-04 02:04:12,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 179 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:04:12,019 INFO L231 Difference]: Finished difference. Result has 61 places, 95 transitions, 1039 flow [2025-03-04 02:04:12,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=61, PETRI_TRANSITIONS=95} [2025-03-04 02:04:12,019 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2025-03-04 02:04:12,019 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 95 transitions, 1039 flow [2025-03-04 02:04:12,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-03-04 02:04:12,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:12,020 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-03-04 02:04:12,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:04:12,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:04:12,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1096091370, now seen corresponding path program 1 times [2025-03-04 02:04:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:12,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628289003] [2025-03-04 02:04:12,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:12,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:04:12,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:04:12,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:12,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:04:12,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:04:12,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:04:12,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:04:12,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:12,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:04:12,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:04:12,039 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:04:12,039 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-04 02:04:12,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-04 02:04:12,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-04 02:04:12,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-04 02:04:12,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-04 02:04:12,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-04 02:04:12,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:04:12,040 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-03-04 02:04:12,040 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:04:12,040 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-04 02:04:12,054 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:04:12,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 108 flow [2025-03-04 02:04:12,058 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2025-03-04 02:04:12,058 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 02:04:12,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 44 events. 0/44 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-03-04 02:04:12,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 34 transitions, 108 flow [2025-03-04 02:04:12,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 34 transitions, 108 flow [2025-03-04 02:04:12,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:04:12,060 INFO L333 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;@5014f02a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:04:12,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:04:12,061 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:04:12,061 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 02:04:12,061 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:04:12,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:12,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:04:12,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-04 02:04:12,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1656981586, now seen corresponding path program 1 times [2025-03-04 02:04:12,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:12,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902734651] [2025-03-04 02:04:12,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:12,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:04:12,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:04:12,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:12,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:04:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:04:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:04:12,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902734651] [2025-03-04 02:04:12,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902734651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:04:12,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:04:12,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:04:12,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105378008] [2025-03-04 02:04:12,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:04:12,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:04:12,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:04:12,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:04:12,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:04:12,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-03-04 02:04:12,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-03-04 02:04:12,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:04:12,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-03-04 02:04:12,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:04:16,799 INFO L124 PetriNetUnfolderBase]: 97851/126043 cut-off events. [2025-03-04 02:04:16,799 INFO L125 PetriNetUnfolderBase]: For 36230/36230 co-relation queries the response was YES. [2025-03-04 02:04:16,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264858 conditions, 126043 events. 97851/126043 cut-off events. For 36230/36230 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 716075 event pairs, 56393 based on Foata normal form. 0/105265 useless extension candidates. Maximal degree in co-relation 35315. Up to 84136 conditions per place. [2025-03-04 02:04:17,525 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 53 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-03-04 02:04:17,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 310 flow [2025-03-04 02:04:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:04:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:04:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-04 02:04:17,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2025-03-04 02:04:17,526 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 108 flow. Second operand 3 states and 65 transitions. [2025-03-04 02:04:17,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 310 flow [2025-03-04 02:04:17,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 286 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-03-04 02:04:17,536 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 140 flow [2025-03-04 02:04:17,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-03-04 02:04:17,537 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2025-03-04 02:04:17,537 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 140 flow [2025-03-04 02:04:17,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-03-04 02:04:17,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:17,537 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 02:04:17,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:04:17,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-04 02:04:17,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1081249682, now seen corresponding path program 1 times [2025-03-04 02:04:17,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:17,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053904257] [2025-03-04 02:04:17,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:17,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:17,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:04:17,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:04:17,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:17,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:04:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:04:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:04:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053904257] [2025-03-04 02:04:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053904257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:04:17,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:04:17,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:04:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395307902] [2025-03-04 02:04:17,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:04:17,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:04:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:04:17,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:04:17,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:04:17,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-03-04 02:04:17,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-04 02:04:17,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:04:17,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-03-04 02:04:17,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:04:24,631 INFO L124 PetriNetUnfolderBase]: 140281/181269 cut-off events. [2025-03-04 02:04:24,632 INFO L125 PetriNetUnfolderBase]: For 76649/76649 co-relation queries the response was YES. [2025-03-04 02:04:25,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429056 conditions, 181269 events. 140281/181269 cut-off events. For 76649/76649 co-relation queries the response was YES. Maximal size of possible extension queue 5212. Compared 1083774 event pairs, 73535 based on Foata normal form. 0/157427 useless extension candidates. Maximal degree in co-relation 382197. Up to 121118 conditions per place. [2025-03-04 02:04:25,841 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 57 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2025-03-04 02:04:25,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 379 flow [2025-03-04 02:04:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:04:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:04:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-04 02:04:25,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-03-04 02:04:25,842 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 140 flow. Second operand 3 states and 62 transitions. [2025-03-04 02:04:25,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 379 flow [2025-03-04 02:04:27,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:04:27,029 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 216 flow [2025-03-04 02:04:27,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-03-04 02:04:27,030 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2025-03-04 02:04:27,030 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 216 flow [2025-03-04 02:04:27,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03-04 02:04:27,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:04:27,030 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:04:27,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:04:27,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-04 02:04:27,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:04:27,031 INFO L85 PathProgramCache]: Analyzing trace with hash 298265304, now seen corresponding path program 1 times [2025-03-04 02:04:27,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:04:27,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480321393] [2025-03-04 02:04:27,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:04:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:04:27,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:04:27,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:04:27,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:04:27,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:04:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:04:27,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:04:27,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480321393] [2025-03-04 02:04:27,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480321393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:04:27,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:04:27,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:04:27,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454510397] [2025-03-04 02:04:27,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:04:27,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:04:27,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:04:27,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:04:27,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:04:27,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-03-04 02:04:27,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-03-04 02:04:27,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:04:27,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-03-04 02:04:27,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand