./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe031_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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-wmm/safe031_tso.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 26b6897a83c9df9076ea7ea4c612ce46453382fa627c0d6af54da2d169befd96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:54:24,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:54:24,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:54:24,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:54:24,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:54:24,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:54:24,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:54:24,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:54:24,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:54:24,192 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:54:24,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:54:24,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:54:24,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:54:24,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:54:24,193 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:54:24,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:54:24,194 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:24,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:54:24,194 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:54:24,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:54:24,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:54:24,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:54:24,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:54:24,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:54:24,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:54:24,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:54:24,195 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 -> 26b6897a83c9df9076ea7ea4c612ce46453382fa627c0d6af54da2d169befd96 [2025-03-14 00:54:24,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:54:24,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:54:24,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:54:24,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:54:24,471 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:54:24,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe031_tso.i [2025-03-14 00:54:25,652 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2ad9297/4ab60dc764ac440ea6b97e004e136167/FLAGd5a79eae7 [2025-03-14 00:54:25,929 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:54:25,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe031_tso.i [2025-03-14 00:54:25,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2ad9297/4ab60dc764ac440ea6b97e004e136167/FLAGd5a79eae7 [2025-03-14 00:54:26,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2ad9297/4ab60dc764ac440ea6b97e004e136167 [2025-03-14 00:54:26,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:54:26,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:54:26,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:26,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:54:26,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:54:26,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5766f10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26, skipping insertion in model container [2025-03-14 00:54:26,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:54:26,364 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-wmm/safe031_tso.i[945,958] [2025-03-14 00:54:26,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:26,513 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:54:26,521 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-wmm/safe031_tso.i[945,958] [2025-03-14 00:54:26,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:26,568 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:54:26,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26 WrapperNode [2025-03-14 00:54:26,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:26,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:26,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:54:26,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:54:26,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,595 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2025-03-14 00:54:26,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:26,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:54:26,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:54:26,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:54:26,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,611 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-14 00:54:26,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:54:26,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:54:26,632 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:54:26,632 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:54:26,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (1/1) ... [2025-03-14 00:54:26,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:26,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:54:26,662 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-14 00:54:26,665 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-14 00:54:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 00:54:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:54:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-14 00:54:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-14 00:54:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-14 00:54:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-14 00:54:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-14 00:54:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-14 00:54:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:54:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 00:54:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:54:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:54:26,686 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:54:26,787 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:54:26,788 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:54:26,935 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:54:26,936 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:54:26,936 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:54:27,029 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:54:27,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:27 BoogieIcfgContainer [2025-03-14 00:54:27,030 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:54:27,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:54:27,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:54:27,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:54:27,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:54:26" (1/3) ... [2025-03-14 00:54:27,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c392b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:27, skipping insertion in model container [2025-03-14 00:54:27,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:26" (2/3) ... [2025-03-14 00:54:27,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c392b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:27, skipping insertion in model container [2025-03-14 00:54:27,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:27" (3/3) ... [2025-03-14 00:54:27,037 INFO L128 eAbstractionObserver]: Analyzing ICFG safe031_tso.i [2025-03-14 00:54:27,046 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:54:27,048 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe031_tso.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-14 00:54:27,048 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:54:27,082 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:54:27,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2025-03-14 00:54:27,143 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-03-14 00:54:27,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:54:27,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-03-14 00:54:27,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2025-03-14 00:54:27,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2025-03-14 00:54:27,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:54:27,168 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;@40c99a0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:54:27,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:54:27,181 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:54:27,181 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-14 00:54:27,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:54:27,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:27,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:27,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:27,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:27,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1090067551, now seen corresponding path program 1 times [2025-03-14 00:54:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:27,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104953404] [2025-03-14 00:54:27,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:27,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:27,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:54:27,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:54:27,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:27,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:27,596 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-14 00:54:27,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:27,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104953404] [2025-03-14 00:54:27,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104953404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:27,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:27,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833130670] [2025-03-14 00:54:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:27,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:54:27,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:27,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:54:27,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:54:27,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:27,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-14 00:54:27,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:27,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:27,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:28,792 INFO L124 PetriNetUnfolderBase]: 10480/15321 cut-off events. [2025-03-14 00:54:28,793 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-14 00:54:28,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30563 conditions, 15321 events. 10480/15321 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 92238 event pairs, 2948 based on Foata normal form. 448/15759 useless extension candidates. Maximal degree in co-relation 30552. Up to 6335 conditions per place. [2025-03-14 00:54:28,874 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 49 selfloop transitions, 6 changer transitions 67/126 dead transitions. [2025-03-14 00:54:28,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 126 transitions, 511 flow [2025-03-14 00:54:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:54:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:54:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2025-03-14 00:54:28,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6336996336996337 [2025-03-14 00:54:28,886 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 7 states and 173 transitions. [2025-03-14 00:54:28,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 126 transitions, 511 flow [2025-03-14 00:54:28,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 126 transitions, 506 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:54:28,899 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 146 flow [2025-03-14 00:54:28,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=7, PETRI_FLOW=146, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2025-03-14 00:54:28,905 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2025-03-14 00:54:28,905 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 146 flow [2025-03-14 00:54:28,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-14 00:54:28,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:28,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:28,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:54:28,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:28,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:28,907 INFO L85 PathProgramCache]: Analyzing trace with hash 580914848, now seen corresponding path program 1 times [2025-03-14 00:54:28,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:28,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839585034] [2025-03-14 00:54:28,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:28,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:28,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:54:28,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:54:28,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:28,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:29,098 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-14 00:54:29,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:29,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839585034] [2025-03-14 00:54:29,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839585034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:29,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:29,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:29,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135266459] [2025-03-14 00:54:29,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:29,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:29,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:29,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:29,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:29,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:29,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:54:29,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:29,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:29,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:30,147 INFO L124 PetriNetUnfolderBase]: 9592/14120 cut-off events. [2025-03-14 00:54:30,148 INFO L125 PetriNetUnfolderBase]: For 11545/11563 co-relation queries the response was YES. [2025-03-14 00:54:30,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37458 conditions, 14120 events. 9592/14120 cut-off events. For 11545/11563 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 83748 event pairs, 1356 based on Foata normal form. 352/14461 useless extension candidates. Maximal degree in co-relation 37442. Up to 5909 conditions per place. [2025-03-14 00:54:30,209 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 60 selfloop transitions, 10 changer transitions 80/154 dead transitions. [2025-03-14 00:54:30,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 154 transitions, 846 flow [2025-03-14 00:54:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:54:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:54:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 221 transitions. [2025-03-14 00:54:30,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-14 00:54:30,211 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 146 flow. Second operand 10 states and 221 transitions. [2025-03-14 00:54:30,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 154 transitions, 846 flow [2025-03-14 00:54:30,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 154 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:54:30,228 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 218 flow [2025-03-14 00:54:30,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=218, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2025-03-14 00:54:30,229 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-03-14 00:54:30,229 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 218 flow [2025-03-14 00:54:30,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:54:30,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:30,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:30,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:54:30,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:30,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash 965099584, now seen corresponding path program 1 times [2025-03-14 00:54:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:30,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894516869] [2025-03-14 00:54:30,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:30,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:30,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:54:30,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:54:30,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:30,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:30,347 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-14 00:54:30,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:30,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894516869] [2025-03-14 00:54:30,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894516869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:30,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:30,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:30,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342090567] [2025-03-14 00:54:30,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:30,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:30,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:30,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:30,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:30,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:54:30,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:30,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:30,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:31,254 INFO L124 PetriNetUnfolderBase]: 9470/13945 cut-off events. [2025-03-14 00:54:31,255 INFO L125 PetriNetUnfolderBase]: For 32563/32563 co-relation queries the response was YES. [2025-03-14 00:54:31,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42077 conditions, 13945 events. 9470/13945 cut-off events. For 32563/32563 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 83450 event pairs, 1314 based on Foata normal form. 382/14323 useless extension candidates. Maximal degree in co-relation 42053. Up to 5925 conditions per place. [2025-03-14 00:54:31,330 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 63 selfloop transitions, 12 changer transitions 80/159 dead transitions. [2025-03-14 00:54:31,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 159 transitions, 980 flow [2025-03-14 00:54:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:54:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:54:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2025-03-14 00:54:31,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5564102564102564 [2025-03-14 00:54:31,336 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 218 flow. Second operand 10 states and 217 transitions. [2025-03-14 00:54:31,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 159 transitions, 980 flow [2025-03-14 00:54:31,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 159 transitions, 924 flow, removed 28 selfloop flow, removed 6 redundant places. [2025-03-14 00:54:31,420 INFO L231 Difference]: Finished difference. Result has 69 places, 48 transitions, 308 flow [2025-03-14 00:54:31,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=308, PETRI_PLACES=69, PETRI_TRANSITIONS=48} [2025-03-14 00:54:31,422 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2025-03-14 00:54:31,422 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 48 transitions, 308 flow [2025-03-14 00:54:31,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-14 00:54:31,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:31,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:31,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:54:31,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:31,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:31,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1295623745, now seen corresponding path program 1 times [2025-03-14 00:54:31,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:31,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550467543] [2025-03-14 00:54:31,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:31,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:54:31,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:54:31,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:31,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:31,536 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-14 00:54:31,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:31,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550467543] [2025-03-14 00:54:31,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550467543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:31,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:31,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:54:31,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387417690] [2025-03-14 00:54:31,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:31,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:54:31,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:31,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:54:31,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:54:31,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:54:31,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 48 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-14 00:54:31,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:31,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:54:31,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:32,075 INFO L124 PetriNetUnfolderBase]: 6093/9555 cut-off events. [2025-03-14 00:54:32,076 INFO L125 PetriNetUnfolderBase]: For 24223/24241 co-relation queries the response was YES. [2025-03-14 00:54:32,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29424 conditions, 9555 events. 6093/9555 cut-off events. For 24223/24241 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 58557 event pairs, 996 based on Foata normal form. 448/9992 useless extension candidates. Maximal degree in co-relation 29395. Up to 4730 conditions per place. [2025-03-14 00:54:32,239 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 94 selfloop transitions, 5 changer transitions 1/105 dead transitions. [2025-03-14 00:54:32,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 105 transitions, 908 flow [2025-03-14 00:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:54:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:54:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-03-14 00:54:32,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6474358974358975 [2025-03-14 00:54:32,242 INFO L175 Difference]: Start difference. First operand has 69 places, 48 transitions, 308 flow. Second operand 4 states and 101 transitions. [2025-03-14 00:54:32,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 105 transitions, 908 flow [2025-03-14 00:54:32,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 105 transitions, 866 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:32,285 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 320 flow [2025-03-14 00:54:32,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=320, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2025-03-14 00:54:32,286 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2025-03-14 00:54:32,286 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 320 flow [2025-03-14 00:54:32,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-14 00:54:32,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:32,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:32,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:54:32,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:32,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:32,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1546187437, now seen corresponding path program 1 times [2025-03-14 00:54:32,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:32,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062952149] [2025-03-14 00:54:32,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:32,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 00:54:32,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:54:32,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:32,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:32,416 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-14 00:54:32,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:32,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062952149] [2025-03-14 00:54:32,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062952149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:32,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:32,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:54:32,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014619223] [2025-03-14 00:54:32,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:32,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:32,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:32,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:32,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:32,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:32,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-14 00:54:32,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:32,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:32,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:33,252 INFO L124 PetriNetUnfolderBase]: 9292/13977 cut-off events. [2025-03-14 00:54:33,253 INFO L125 PetriNetUnfolderBase]: For 22345/22345 co-relation queries the response was YES. [2025-03-14 00:54:33,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43137 conditions, 13977 events. 9292/13977 cut-off events. For 22345/22345 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 85272 event pairs, 2287 based on Foata normal form. 288/14261 useless extension candidates. Maximal degree in co-relation 43108. Up to 5438 conditions per place. [2025-03-14 00:54:33,316 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 76 selfloop transitions, 14 changer transitions 84/178 dead transitions. [2025-03-14 00:54:33,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 178 transitions, 1193 flow [2025-03-14 00:54:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:54:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:54:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 225 transitions. [2025-03-14 00:54:33,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2025-03-14 00:54:33,318 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 320 flow. Second operand 10 states and 225 transitions. [2025-03-14 00:54:33,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 178 transitions, 1193 flow [2025-03-14 00:54:33,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 178 transitions, 1167 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:33,364 INFO L231 Difference]: Finished difference. Result has 77 places, 50 transitions, 366 flow [2025-03-14 00:54:33,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=366, PETRI_PLACES=77, PETRI_TRANSITIONS=50} [2025-03-14 00:54:33,364 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2025-03-14 00:54:33,364 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 50 transitions, 366 flow [2025-03-14 00:54:33,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-14 00:54:33,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:33,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:33,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:54:33,365 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:33,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:33,366 INFO L85 PathProgramCache]: Analyzing trace with hash -227285405, now seen corresponding path program 1 times [2025-03-14 00:54:33,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:33,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991772178] [2025-03-14 00:54:33,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:33,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:33,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 00:54:33,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:54:33,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:33,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:33,457 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-14 00:54:33,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:33,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991772178] [2025-03-14 00:54:33,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991772178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:33,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:33,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:33,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002838322] [2025-03-14 00:54:33,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:33,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:54:33,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:33,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:54:33,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:54:33,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:54:33,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 50 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-14 00:54:33,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:33,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:54:33,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:33,915 INFO L124 PetriNetUnfolderBase]: 4885/7681 cut-off events. [2025-03-14 00:54:33,915 INFO L125 PetriNetUnfolderBase]: For 19374/19392 co-relation queries the response was YES. [2025-03-14 00:54:33,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23660 conditions, 7681 events. 4885/7681 cut-off events. For 19374/19392 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 44772 event pairs, 733 based on Foata normal form. 476/8146 useless extension candidates. Maximal degree in co-relation 23625. Up to 2572 conditions per place. [2025-03-14 00:54:33,938 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 93 selfloop transitions, 8 changer transitions 16/122 dead transitions. [2025-03-14 00:54:33,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 122 transitions, 1158 flow [2025-03-14 00:54:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:54:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:54:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-14 00:54:33,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2025-03-14 00:54:33,939 INFO L175 Difference]: Start difference. First operand has 77 places, 50 transitions, 366 flow. Second operand 5 states and 129 transitions. [2025-03-14 00:54:33,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 122 transitions, 1158 flow [2025-03-14 00:54:33,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 122 transitions, 1092 flow, removed 17 selfloop flow, removed 5 redundant places. [2025-03-14 00:54:33,962 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 359 flow [2025-03-14 00:54:33,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2025-03-14 00:54:33,963 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2025-03-14 00:54:33,963 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 359 flow [2025-03-14 00:54:33,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-14 00:54:33,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:33,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:33,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:54:33,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:33,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:33,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1994501199, now seen corresponding path program 1 times [2025-03-14 00:54:33,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:33,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602515958] [2025-03-14 00:54:33,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:33,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:54:33,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:54:33,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:33,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:34,056 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-14 00:54:34,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:34,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602515958] [2025-03-14 00:54:34,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602515958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:34,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:34,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:54:34,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46901606] [2025-03-14 00:54:34,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:34,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:34,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:34,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:34,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:34,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:34,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-14 00:54:34,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:34,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:34,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:34,595 INFO L124 PetriNetUnfolderBase]: 5185/8110 cut-off events. [2025-03-14 00:54:34,595 INFO L125 PetriNetUnfolderBase]: For 15132/15132 co-relation queries the response was YES. [2025-03-14 00:54:34,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25520 conditions, 8110 events. 5185/8110 cut-off events. For 15132/15132 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 47248 event pairs, 1595 based on Foata normal form. 56/8156 useless extension candidates. Maximal degree in co-relation 25498. Up to 3223 conditions per place. [2025-03-14 00:54:34,626 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 72 selfloop transitions, 12 changer transitions 38/126 dead transitions. [2025-03-14 00:54:34,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 126 transitions, 948 flow [2025-03-14 00:54:34,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:54:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:54:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2025-03-14 00:54:34,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2025-03-14 00:54:34,628 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 359 flow. Second operand 6 states and 141 transitions. [2025-03-14 00:54:34,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 126 transitions, 948 flow [2025-03-14 00:54:34,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 126 transitions, 848 flow, removed 18 selfloop flow, removed 9 redundant places. [2025-03-14 00:54:34,654 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 317 flow [2025-03-14 00:54:34,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2025-03-14 00:54:34,655 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2025-03-14 00:54:34,655 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 317 flow [2025-03-14 00:54:34,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-14 00:54:34,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:34,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:34,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:54:34,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:34,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1029575341, now seen corresponding path program 2 times [2025-03-14 00:54:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:34,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925673512] [2025-03-14 00:54:34,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:54:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:34,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:54:34,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:54:34,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:54:34,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:34,746 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-14 00:54:34,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:34,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925673512] [2025-03-14 00:54:34,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925673512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:34,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:34,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:34,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25707229] [2025-03-14 00:54:34,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:34,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:34,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:34,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:34,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:34,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:54:34,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 317 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-14 00:54:34,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:34,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:54:34,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:35,072 INFO L124 PetriNetUnfolderBase]: 2921/4637 cut-off events. [2025-03-14 00:54:35,072 INFO L125 PetriNetUnfolderBase]: For 10064/10064 co-relation queries the response was YES. [2025-03-14 00:54:35,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13900 conditions, 4637 events. 2921/4637 cut-off events. For 10064/10064 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 25178 event pairs, 573 based on Foata normal form. 192/4824 useless extension candidates. Maximal degree in co-relation 13880. Up to 1656 conditions per place. [2025-03-14 00:54:35,089 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 51 selfloop transitions, 11 changer transitions 30/97 dead transitions. [2025-03-14 00:54:35,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 804 flow [2025-03-14 00:54:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:54:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:54:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-14 00:54:35,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-03-14 00:54:35,090 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 317 flow. Second operand 6 states and 129 transitions. [2025-03-14 00:54:35,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 804 flow [2025-03-14 00:54:35,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 97 transitions, 760 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:35,099 INFO L231 Difference]: Finished difference. Result has 72 places, 39 transitions, 218 flow [2025-03-14 00:54:35,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=72, PETRI_TRANSITIONS=39} [2025-03-14 00:54:35,099 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2025-03-14 00:54:35,100 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 39 transitions, 218 flow [2025-03-14 00:54:35,100 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-14 00:54:35,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:35,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:35,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:54:35,100 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 00:54:35,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1319296880, now seen corresponding path program 1 times [2025-03-14 00:54:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122623451] [2025-03-14 00:54:35,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:35,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 00:54:35,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 00:54:35,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:35,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:35,225 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-14 00:54:35,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:35,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122623451] [2025-03-14 00:54:35,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122623451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:35,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:35,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:54:35,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624417001] [2025-03-14 00:54:35,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:35,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:54:35,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:35,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:54:35,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:54:35,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:54:35,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 39 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-14 00:54:35,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:35,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:54:35,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:35,371 INFO L124 PetriNetUnfolderBase]: 509/811 cut-off events. [2025-03-14 00:54:35,371 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-14 00:54:35,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2610 conditions, 811 events. 509/811 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2724 event pairs, 208 based on Foata normal form. 8/818 useless extension candidates. Maximal degree in co-relation 2591. Up to 551 conditions per place. [2025-03-14 00:54:35,374 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2025-03-14 00:54:35,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 55 transitions, 380 flow [2025-03-14 00:54:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:54:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:54:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2025-03-14 00:54:35,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3443223443223443 [2025-03-14 00:54:35,375 INFO L175 Difference]: Start difference. First operand has 72 places, 39 transitions, 218 flow. Second operand 7 states and 94 transitions. [2025-03-14 00:54:35,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 55 transitions, 380 flow [2025-03-14 00:54:35,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 254 flow, removed 16 selfloop flow, removed 24 redundant places. [2025-03-14 00:54:35,378 INFO L231 Difference]: Finished difference. Result has 52 places, 0 transitions, 0 flow [2025-03-14 00:54:35,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=52, PETRI_TRANSITIONS=0} [2025-03-14 00:54:35,379 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2025-03-14 00:54:35,379 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 0 transitions, 0 flow [2025-03-14 00:54:35,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-14 00:54:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 00:54:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 00:54:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 00:54:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-14 00:54:35,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:54:35,382 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:35,384 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:54:35,384 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:54:35,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:54:35 BasicIcfg [2025-03-14 00:54:35,387 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:54:35,388 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:54:35,388 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:54:35,388 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:54:35,388 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:27" (3/4) ... [2025-03-14 00:54:35,389 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:54:35,391 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-14 00:54:35,391 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-14 00:54:35,391 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-14 00:54:35,394 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2025-03-14 00:54:35,394 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-14 00:54:35,394 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 00:54:35,394 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:54:35,441 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:54:35,441 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:54:35,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:54:35,441 INFO L158 Benchmark]: Toolchain (without parser) took 9227.17ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 122.5MB in the beginning and 907.1MB in the end (delta: -784.6MB). Peak memory consumption was 729.5MB. Max. memory is 16.1GB. [2025-03-14 00:54:35,442 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:54:35,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.75ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 102.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:54:35,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.42ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 100.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:54:35,442 INFO L158 Benchmark]: Boogie Preprocessor took 31.67ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:54:35,442 INFO L158 Benchmark]: IcfgBuilder took 398.48ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 77.1MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:54:35,442 INFO L158 Benchmark]: TraceAbstraction took 8355.40ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 76.3MB in the beginning and 911.3MB in the end (delta: -834.9MB). Peak memory consumption was 687.5MB. Max. memory is 16.1GB. [2025-03-14 00:54:35,442 INFO L158 Benchmark]: Witness Printer took 53.33ms. Allocated memory is still 1.7GB. Free memory was 911.3MB in the beginning and 907.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:54:35,447 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.75ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 102.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.42ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 100.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.67ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 398.48ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 77.1MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8355.40ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 76.3MB in the beginning and 911.3MB in the end (delta: -834.9MB). Peak memory consumption was 687.5MB. Max. memory is 16.1GB. * Witness Printer took 53.33ms. Allocated memory is still 1.7GB. Free memory was 911.3MB in the beginning and 907.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 730 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 725 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1660 IncrementalHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 12 mSDtfsCounter, 1660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=5, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 839 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 00:54:35,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE