./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.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-lit/sssc12.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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:11:55,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:11:55,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:11:55,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:11:55,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:11:55,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:11:55,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:11:55,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:11:55,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:11:55,498 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:11:55,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:11:55,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:11:55,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:11:55,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:11:55,498 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:11:55,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:11:55,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:11:55,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:11:55,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:11:55,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:11:55,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:11:55,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:11:55,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:11:55,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:11:55,501 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:11:55,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:11:55,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:11:55,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:11:55,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:11:55,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:11:55,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:11:55,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:11:55,501 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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-03-04 02:11:55,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:11:55,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:11:55,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:11:55,735 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:11:55,736 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:11:55,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-04 02:11:56,814 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fab80a49/1c0843cbbc754d48826a7feb76897535/FLAG4d8954c04 [2025-03-04 02:11:57,140 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:11:57,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-04 02:11:57,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fab80a49/1c0843cbbc754d48826a7feb76897535/FLAG4d8954c04 [2025-03-04 02:11:57,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fab80a49/1c0843cbbc754d48826a7feb76897535 [2025-03-04 02:11:57,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:11:57,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:11:57,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:11:57,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:11:57,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:11:57,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d89f267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57, skipping insertion in model container [2025-03-04 02:11:57,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:11:57,740 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-lit/sssc12.i[47777,47790] [2025-03-04 02:11:57,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:11:57,763 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:11:57,788 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-lit/sssc12.i[47777,47790] [2025-03-04 02:11:57,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:11:57,834 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:11:57,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57 WrapperNode [2025-03-04 02:11:57,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:11:57,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:11:57,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:11:57,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:11:57,840 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:11:57" (1/1) ... [2025-03-04 02:11:57,850 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:11:57" (1/1) ... [2025-03-04 02:11:57,864 INFO L138 Inliner]: procedures = 272, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2025-03-04 02:11:57,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:11:57,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:11:57,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:11:57,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:11:57,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,886 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 1, 5]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-03-04 02:11:57,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:11:57,898 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:11:57,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:11:57,898 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:11:57,899 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (1/1) ... [2025-03-04 02:11:57,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:11:57,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:11:57,923 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:11:57,926 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:11:57,945 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-03-04 02:11:57,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-03-04 02:11:57,945 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:11:57,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:11:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:11:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:11:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:11:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:11:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:11:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:11:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:11:57,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:11:57,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:11:57,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:11:57,948 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:11:58,039 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:11:58,040 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:11:58,166 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:11:58,166 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:11:58,262 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:11:58,263 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:11:58,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:11:58 BoogieIcfgContainer [2025-03-04 02:11:58,263 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:11:58,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:11:58,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:11:58,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:11:58,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:11:57" (1/3) ... [2025-03-04 02:11:58,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34da4c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:11:58, skipping insertion in model container [2025-03-04 02:11:58,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:11:57" (2/3) ... [2025-03-04 02:11:58,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34da4c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:11:58, skipping insertion in model container [2025-03-04 02:11:58,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:11:58" (3/3) ... [2025-03-04 02:11:58,271 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-03-04 02:11:58,281 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:11:58,283 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:11:58,283 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:11:58,315 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:11:58,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 18 transitions, 40 flow [2025-03-04 02:11:58,367 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-03-04 02:11:58,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:11:58,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 20 events. 2/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-03-04 02:11:58,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 18 transitions, 40 flow [2025-03-04 02:11:58,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 18 transitions, 40 flow [2025-03-04 02:11:58,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:11:58,390 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;@52f4a8d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:11:58,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:11:58,395 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:11:58,396 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 02:11:58,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:11:58,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:58,396 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 02:11:58,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:11:58,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash 895973485, now seen corresponding path program 1 times [2025-03-04 02:11:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:58,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207601064] [2025-03-04 02:11:58,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:58,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:58,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:11:58,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:11:58,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:58,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:11:58,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:11:58,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:11:58,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:11:58,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:58,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:11:58,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:11:58,545 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:11:58,546 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-04 02:11:58,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-04 02:11:58,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-04 02:11:58,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:11:58,549 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-04 02:11:58,555 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:11:58,555 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 02:11:58,575 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:11:58,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 72 flow [2025-03-04 02:11:58,592 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-03-04 02:11:58,593 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:11:58,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 36 events. 4/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-03-04 02:11:58,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 72 flow [2025-03-04 02:11:58,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 31 transitions, 72 flow [2025-03-04 02:11:58,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:11:58,599 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;@52f4a8d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:11:58,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:11:58,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:11:58,607 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 02:11:58,607 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:11:58,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:58,608 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-04 02:11:58,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 02:11:58,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1440960105, now seen corresponding path program 1 times [2025-03-04 02:11:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:58,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873384141] [2025-03-04 02:11:58,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:58,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:58,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:11:58,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:11:58,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:58,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:11:58,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:11:58,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:11:58,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:11:58,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:58,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:11:58,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:11:58,673 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:11:58,673 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-04 02:11:58,673 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-04 02:11:58,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-04 02:11:58,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-04 02:11:58,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:11:58,674 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-04 02:11:58,675 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:11:58,675 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 02:11:58,718 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:11:58,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 106 flow [2025-03-04 02:11:58,735 INFO L124 PetriNetUnfolderBase]: 6/52 cut-off events. [2025-03-04 02:11:58,736 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:11:58,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 6/52 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 118 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 43. Up to 4 conditions per place. [2025-03-04 02:11:58,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 44 transitions, 106 flow [2025-03-04 02:11:58,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 106 flow [2025-03-04 02:11:58,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:11:58,740 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;@52f4a8d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:11:58,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:11:58,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:11:58,750 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-03-04 02:11:58,750 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:11:58,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:11:58,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:11:58,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:11:58,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:11:58,752 INFO L85 PathProgramCache]: Analyzing trace with hash -140863672, now seen corresponding path program 1 times [2025-03-04 02:11:58,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:11:58,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060770631] [2025-03-04 02:11:58,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:11:58,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:11:58,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:11:58,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:11:58,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:11:58,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:11:59,040 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:11:59,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:11:59,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060770631] [2025-03-04 02:11:59,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060770631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:11:59,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:11:59,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:11:59,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703300574] [2025-03-04 02:11:59,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:11:59,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:11:59,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:11:59,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:11:59,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:11:59,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-03-04 02:11:59,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:11:59,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:11:59,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-03-04 02:11:59,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:00,249 INFO L124 PetriNetUnfolderBase]: 8725/13362 cut-off events. [2025-03-04 02:12:00,250 INFO L125 PetriNetUnfolderBase]: For 721/721 co-relation queries the response was YES. [2025-03-04 02:12:00,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25734 conditions, 13362 events. 8725/13362 cut-off events. For 721/721 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 85432 event pairs, 1834 based on Foata normal form. 963/11922 useless extension candidates. Maximal degree in co-relation 17547. Up to 6223 conditions per place. [2025-03-04 02:12:00,349 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 101 selfloop transitions, 12 changer transitions 0/124 dead transitions. [2025-03-04 02:12:00,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 124 transitions, 552 flow [2025-03-04 02:12:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:12:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:12:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2025-03-04 02:12:00,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6688311688311688 [2025-03-04 02:12:00,362 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 106 flow. Second operand 7 states and 206 transitions. [2025-03-04 02:12:00,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 124 transitions, 552 flow [2025-03-04 02:12:00,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 540 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 02:12:00,374 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 180 flow [2025-03-04 02:12:00,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-03-04 02:12:00,379 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2025-03-04 02:12:00,379 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 180 flow [2025-03-04 02:12:00,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:12:00,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:00,379 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-04 02:12:00,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:12:00,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:12:00,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1866264940, now seen corresponding path program 1 times [2025-03-04 02:12:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:00,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644482469] [2025-03-04 02:12:00,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:00,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:00,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:12:00,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:12:00,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:00,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:12:00,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:12:00,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:12:00,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:12:00,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:00,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:12:00,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:12:00,420 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:12:00,420 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 02:12:00,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-04 02:12:00,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-04 02:12:00,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-04 02:12:00,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-04 02:12:00,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:12:00,421 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 02:12:00,422 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:12:00,422 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 02:12:00,443 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:12:00,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 142 flow [2025-03-04 02:12:00,451 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2025-03-04 02:12:00,451 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 02:12:00,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 68 events. 8/68 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 158 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 64. Up to 5 conditions per place. [2025-03-04 02:12:00,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 57 transitions, 142 flow [2025-03-04 02:12:00,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 57 transitions, 142 flow [2025-03-04 02:12:00,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:12:00,453 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;@52f4a8d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:12:00,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:12:00,457 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:12:00,458 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-03-04 02:12:00,458 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 02:12:00,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:00,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:00,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:12:00,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:00,458 INFO L85 PathProgramCache]: Analyzing trace with hash -969217043, now seen corresponding path program 1 times [2025-03-04 02:12:00,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:00,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111709569] [2025-03-04 02:12:00,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:00,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:00,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:12:00,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:12:00,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:00,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:00,705 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:12:00,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:00,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111709569] [2025-03-04 02:12:00,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111709569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:00,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:00,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:12:00,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081276170] [2025-03-04 02:12:00,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:00,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:12:00,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:00,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:12:00,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:12:00,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-04 02:12:00,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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:12:00,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:00,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-04 02:12:00,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:07,032 INFO L124 PetriNetUnfolderBase]: 98531/139216 cut-off events. [2025-03-04 02:12:07,033 INFO L125 PetriNetUnfolderBase]: For 9994/9994 co-relation queries the response was YES. [2025-03-04 02:12:07,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268248 conditions, 139216 events. 98531/139216 cut-off events. For 9994/9994 co-relation queries the response was YES. Maximal size of possible extension queue 4519. Compared 1019996 event pairs, 23890 based on Foata normal form. 11088/124117 useless extension candidates. Maximal degree in co-relation 136311. Up to 65858 conditions per place. [2025-03-04 02:12:07,959 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 139 selfloop transitions, 14 changer transitions 0/168 dead transitions. [2025-03-04 02:12:07,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 168 transitions, 775 flow [2025-03-04 02:12:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:12:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:12:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 278 transitions. [2025-03-04 02:12:08,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6967418546365914 [2025-03-04 02:12:08,095 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 142 flow. Second operand 7 states and 278 transitions. [2025-03-04 02:12:08,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 168 transitions, 775 flow [2025-03-04 02:12:08,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 168 transitions, 739 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-04 02:12:08,102 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 226 flow [2025-03-04 02:12:08,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-03-04 02:12:08,104 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-03-04 02:12:08,104 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 226 flow [2025-03-04 02:12:08,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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:12:08,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:08,105 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:08,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:12:08,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:12:08,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2109217172, now seen corresponding path program 1 times [2025-03-04 02:12:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:08,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125599290] [2025-03-04 02:12:08,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:08,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:08,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:12:08,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:12:08,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:08,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:08,261 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:12:08,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:08,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125599290] [2025-03-04 02:12:08,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125599290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:08,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:08,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:12:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559068497] [2025-03-04 02:12:08,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:08,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:12:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:08,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:12:08,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:12:08,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-04 02:12:08,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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:12:08,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:08,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-04 02:12:08,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:19,073 INFO L124 PetriNetUnfolderBase]: 153451/218781 cut-off events. [2025-03-04 02:12:19,073 INFO L125 PetriNetUnfolderBase]: For 84512/86609 co-relation queries the response was YES. [2025-03-04 02:12:19,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477648 conditions, 218781 events. 153451/218781 cut-off events. For 84512/86609 co-relation queries the response was YES. Maximal size of possible extension queue 7564. Compared 1725075 event pairs, 43744 based on Foata normal form. 0/187554 useless extension candidates. Maximal degree in co-relation 398346. Up to 112061 conditions per place. [2025-03-04 02:12:20,827 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 145 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2025-03-04 02:12:20,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 180 transitions, 948 flow [2025-03-04 02:12:20,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:12:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:12:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 255 transitions. [2025-03-04 02:12:20,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6390977443609023 [2025-03-04 02:12:20,829 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 226 flow. Second operand 7 states and 255 transitions. [2025-03-04 02:12:20,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 180 transitions, 948 flow [2025-03-04 02:12:21,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 180 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:12:21,119 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 346 flow [2025-03-04 02:12:21,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-03-04 02:12:21,120 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-03-04 02:12:21,120 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 346 flow [2025-03-04 02:12:21,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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:12:21,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:21,120 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:21,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:12:21,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:12:21,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:21,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1121483071, now seen corresponding path program 1 times [2025-03-04 02:12:21,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:21,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448558567] [2025-03-04 02:12:21,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:21,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:21,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:12:21,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:12:21,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:21,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448558567] [2025-03-04 02:12:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448558567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:12:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84283365] [2025-03-04 02:12:21,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:21,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:12:21,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:12:21,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:12:21,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:12:21,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:12:21,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:12:21,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:21,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:21,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:12:21,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:12:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:21,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:12:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84283365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:12:21,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:12:21,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2025-03-04 02:12:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903792960] [2025-03-04 02:12:21,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:12:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:12:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:21,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:12:21,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:12:21,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-03-04 02:12:21,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 346 flow. Second operand has 18 states, 18 states have (on average 16.77777777777778) internal successors, (302), 18 states have internal predecessors, (302), 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:12:21,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:21,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-03-04 02:12:21,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand