./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/safe019_power.opt.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 57c8b47d74ada5c94291d16aafebbb644062493fff61510a323122bcd88ba5b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:21:38,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:21:38,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:21:38,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:21:38,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:21:38,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:21:38,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:21:38,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:21:38,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:21:38,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:21:38,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:21:38,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:21:38,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:21:38,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:21:38,730 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:21:38,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:21:38,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:21:38,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:21:38,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:21:38,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:21:38,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:21:38,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:21:38,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:21:38,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:21:38,732 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:21:38,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:21:38,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:21:38,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:21:38,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:21:38,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:21:38,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:21:38,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:21:38,733 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 -> 57c8b47d74ada5c94291d16aafebbb644062493fff61510a323122bcd88ba5b1 [2025-03-08 17:21:38,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:21:38,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:21:38,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:21:38,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:21:38,985 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:21:38,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i [2025-03-08 17:21:40,190 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7887d4b4b/8295031e4f534ef6bdf4857fc4b207f5/FLAGb5f037aec [2025-03-08 17:21:40,463 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:21:40,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i [2025-03-08 17:21:40,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7887d4b4b/8295031e4f534ef6bdf4857fc4b207f5/FLAGb5f037aec [2025-03-08 17:21:40,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7887d4b4b/8295031e4f534ef6bdf4857fc4b207f5 [2025-03-08 17:21:40,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:21:40,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:21:40,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:21:40,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:21:40,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:21:40,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:21:40" (1/1) ... [2025-03-08 17:21:40,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b90895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:40, skipping insertion in model container [2025-03-08 17:21:40,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:21:40" (1/1) ... [2025-03-08 17:21:40,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:21:40,916 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/safe019_power.opt.i[994,1007] [2025-03-08 17:21:41,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:21:41,057 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:21:41,067 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/safe019_power.opt.i[994,1007] [2025-03-08 17:21:41,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:21:41,147 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:21:41,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41 WrapperNode [2025-03-08 17:21:41,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:21:41,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:21:41,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:21:41,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:21:41,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,182 INFO L138 Inliner]: procedures = 176, calls = 72, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 178 [2025-03-08 17:21:41,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:21:41,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:21:41,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:21:41,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:21:41,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,205 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 8 writes are split as follows [0, 8]. [2025-03-08 17:21:41,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:21:41,234 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:21:41,234 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:21:41,234 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:21:41,238 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (1/1) ... [2025-03-08 17:21:41,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:21:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:21:41,266 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-08 17:21:41,270 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-08 17:21:41,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:21:41,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:21:41,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:21:41,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:21:41,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:21:41,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:21:41,288 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-08 17:21:41,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-08 17:21:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-08 17:21:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-08 17:21:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-08 17:21:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-08 17:21:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-08 17:21:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-08 17:21:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:21:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:21:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:21:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:21:41,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:21:41,291 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:21:41,426 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:21:41,428 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:21:41,874 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:21:41,874 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:21:42,156 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:21:42,157 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:21:42,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:21:42 BoogieIcfgContainer [2025-03-08 17:21:42,157 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:21:42,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:21:42,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:21:42,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:21:42,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:21:40" (1/3) ... [2025-03-08 17:21:42,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191ed6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:21:42, skipping insertion in model container [2025-03-08 17:21:42,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:21:41" (2/3) ... [2025-03-08 17:21:42,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191ed6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:21:42, skipping insertion in model container [2025-03-08 17:21:42,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:21:42" (3/3) ... [2025-03-08 17:21:42,165 INFO L128 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2025-03-08 17:21:42,176 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:21:42,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe019_power.opt.i that has 5 procedures, 46 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-08 17:21:42,179 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:21:42,262 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:21:42,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 46 transitions, 108 flow [2025-03-08 17:21:42,314 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-03-08 17:21:42,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:21:42,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 42 events. 1/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2025-03-08 17:21:42,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 46 transitions, 108 flow [2025-03-08 17:21:42,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 42 transitions, 96 flow [2025-03-08 17:21:42,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:21:42,333 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;@67d11bb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:21:42,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 17:21:42,338 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:21:42,340 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-08 17:21:42,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:21:42,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:21:42,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 17:21:42,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 17:21:42,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:21:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash 435058010, now seen corresponding path program 1 times [2025-03-08 17:21:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:21:42,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426403826] [2025-03-08 17:21:42,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:21:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:21:42,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 17:21:42,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 17:21:42,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:21:42,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:21:42,765 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-08 17:21:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:21:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426403826] [2025-03-08 17:21:42,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426403826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:21:42,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:21:42,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 17:21:42,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493560822] [2025-03-08 17:21:42,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:21:42,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:21:42,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:21:42,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:21:42,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:21:42,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2025-03-08 17:21:42,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-08 17:21:42,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:21:42,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2025-03-08 17:21:42,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:21:46,283 INFO L124 PetriNetUnfolderBase]: 23617/31806 cut-off events. [2025-03-08 17:21:46,284 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2025-03-08 17:21:46,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63496 conditions, 31806 events. 23617/31806 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 185336 event pairs, 3513 based on Foata normal form. 900/32505 useless extension candidates. Maximal degree in co-relation 63484. Up to 26201 conditions per place. [2025-03-08 17:21:46,445 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 54 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2025-03-08 17:21:46,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 264 flow [2025-03-08 17:21:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:21:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:21:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-03-08 17:21:46,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6811594202898551 [2025-03-08 17:21:46,455 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 3 states and 94 transitions. [2025-03-08 17:21:46,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 264 flow [2025-03-08 17:21:46,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 258 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 17:21:46,463 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 90 flow [2025-03-08 17:21:46,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-03-08 17:21:46,469 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-03-08 17:21:46,469 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 90 flow [2025-03-08 17:21:46,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-08 17:21:46,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:21:46,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:21:46,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:21:46,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 17:21:46,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:21:46,472 INFO L85 PathProgramCache]: Analyzing trace with hash -849089173, now seen corresponding path program 1 times [2025-03-08 17:21:46,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:21:46,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16271827] [2025-03-08 17:21:46,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:21:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:21:46,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 17:21:46,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 17:21:46,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:21:46,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:21:46,774 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-08 17:21:46,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:21:46,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16271827] [2025-03-08 17:21:46,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16271827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:21:46,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:21:46,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:21:46,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463113701] [2025-03-08 17:21:46,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:21:46,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:21:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:21:46,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:21:46,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:21:46,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-08 17:21:46,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-08 17:21:46,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:21:46,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-08 17:21:46,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:21:50,769 INFO L124 PetriNetUnfolderBase]: 33665/45537 cut-off events. [2025-03-08 17:21:50,770 INFO L125 PetriNetUnfolderBase]: For 2196/2196 co-relation queries the response was YES. [2025-03-08 17:21:50,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92829 conditions, 45537 events. 33665/45537 cut-off events. For 2196/2196 co-relation queries the response was YES. Maximal size of possible extension queue 1525. Compared 267390 event pairs, 7155 based on Foata normal form. 0/44646 useless extension candidates. Maximal degree in co-relation 92819. Up to 28979 conditions per place. [2025-03-08 17:21:50,991 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 48 selfloop transitions, 3 changer transitions 84/140 dead transitions. [2025-03-08 17:21:50,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 140 transitions, 576 flow [2025-03-08 17:21:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:21:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:21:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2025-03-08 17:21:50,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5679347826086957 [2025-03-08 17:21:50,993 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 8 states and 209 transitions. [2025-03-08 17:21:50,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 140 transitions, 576 flow [2025-03-08 17:21:50,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 140 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:21:51,000 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 119 flow [2025-03-08 17:21:51,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=119, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-03-08 17:21:51,001 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2025-03-08 17:21:51,002 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 119 flow [2025-03-08 17:21:51,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-08 17:21:51,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:21:51,004 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-08 17:21:51,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:21:51,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 17:21:51,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:21:51,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1629520214, now seen corresponding path program 1 times [2025-03-08 17:21:51,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:21:51,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914270178] [2025-03-08 17:21:51,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:21:51,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:21:51,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 17:21:51,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 17:21:51,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:21:51,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:21:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:21:51,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:21:51,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914270178] [2025-03-08 17:21:51,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914270178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:21:51,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:21:51,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:21:51,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697042783] [2025-03-08 17:21:51,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:21:51,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:21:51,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:21:51,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:21:51,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:21:51,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-08 17:21:51,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-08 17:21:51,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:21:51,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-08 17:21:51,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:21:54,049 INFO L124 PetriNetUnfolderBase]: 26276/35699 cut-off events. [2025-03-08 17:21:54,050 INFO L125 PetriNetUnfolderBase]: For 16776/16786 co-relation queries the response was YES. [2025-03-08 17:21:54,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84311 conditions, 35699 events. 26276/35699 cut-off events. For 16776/16786 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 211552 event pairs, 3362 based on Foata normal form. 840/36529 useless extension candidates. Maximal degree in co-relation 84296. Up to 25961 conditions per place. [2025-03-08 17:21:54,233 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 58 selfloop transitions, 2 changer transitions 65/130 dead transitions. [2025-03-08 17:21:54,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 130 transitions, 631 flow [2025-03-08 17:21:54,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:21:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:21:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2025-03-08 17:21:54,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.577639751552795 [2025-03-08 17:21:54,235 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 119 flow. Second operand 7 states and 186 transitions. [2025-03-08 17:21:54,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 130 transitions, 631 flow [2025-03-08 17:21:54,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 130 transitions, 618 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-08 17:21:54,558 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 128 flow [2025-03-08 17:21:54,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2025-03-08 17:21:54,559 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2025-03-08 17:21:54,559 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 128 flow [2025-03-08 17:21:54,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-08 17:21:54,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:21:54,560 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] [2025-03-08 17:21:54,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:21:54,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 17:21:54,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:21:54,560 INFO L85 PathProgramCache]: Analyzing trace with hash -565457405, now seen corresponding path program 1 times [2025-03-08 17:21:54,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:21:54,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060560909] [2025-03-08 17:21:54,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:21:54,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:21:54,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:21:54,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:21:54,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:21:54,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:21:54,743 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-08 17:21:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:21:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060560909] [2025-03-08 17:21:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060560909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:21:54,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:21:54,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:21:54,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581765262] [2025-03-08 17:21:54,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:21:54,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:21:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:21:54,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:21:54,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:21:54,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-08 17:21:54,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 128 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-08 17:21:54,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:21:54,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-08 17:21:54,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:21:58,349 INFO L124 PetriNetUnfolderBase]: 23847/32404 cut-off events. [2025-03-08 17:21:58,349 INFO L125 PetriNetUnfolderBase]: For 18672/18672 co-relation queries the response was YES. [2025-03-08 17:21:58,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79585 conditions, 32404 events. 23847/32404 cut-off events. For 18672/18672 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 179692 event pairs, 6007 based on Foata normal form. 600/32976 useless extension candidates. Maximal degree in co-relation 79566. Up to 24496 conditions per place. [2025-03-08 17:21:58,642 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 52 selfloop transitions, 2 changer transitions 57/116 dead transitions. [2025-03-08 17:21:58,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 537 flow [2025-03-08 17:21:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:21:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:21:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-03-08 17:21:58,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5403726708074534 [2025-03-08 17:21:58,648 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 128 flow. Second operand 7 states and 174 transitions. [2025-03-08 17:21:58,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 537 flow [2025-03-08 17:21:59,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 116 transitions, 515 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-08 17:21:59,219 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 132 flow [2025-03-08 17:21:59,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2025-03-08 17:21:59,220 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-08 17:21:59,220 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 132 flow [2025-03-08 17:21:59,220 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-08 17:21:59,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:21:59,220 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-08 17:21:59,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:21:59,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 17:21:59,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:21:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1366893242, now seen corresponding path program 1 times [2025-03-08 17:21:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:21:59,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91917449] [2025-03-08 17:21:59,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:21:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:21:59,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:21:59,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:21:59,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:21:59,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:21:59,431 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-08 17:21:59,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:21:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91917449] [2025-03-08 17:21:59,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91917449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:21:59,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:21:59,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:21:59,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778132192] [2025-03-08 17:21:59,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:21:59,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:21:59,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:21:59,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:21:59,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:21:59,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-08 17:21:59,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 40 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-08 17:21:59,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:21:59,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-08 17:21:59,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:22:02,863 INFO L124 PetriNetUnfolderBase]: 35112/47484 cut-off events. [2025-03-08 17:22:02,863 INFO L125 PetriNetUnfolderBase]: For 27939/27992 co-relation queries the response was YES. [2025-03-08 17:22:03,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114429 conditions, 47484 events. 35112/47484 cut-off events. For 27939/27992 co-relation queries the response was YES. Maximal size of possible extension queue 1375. Compared 280440 event pairs, 13830 based on Foata normal form. 930/48363 useless extension candidates. Maximal degree in co-relation 114409. Up to 22124 conditions per place. [2025-03-08 17:22:03,155 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 55 selfloop transitions, 3 changer transitions 61/124 dead transitions. [2025-03-08 17:22:03,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 124 transitions, 583 flow [2025-03-08 17:22:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:22:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:22:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2025-03-08 17:22:03,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5683229813664596 [2025-03-08 17:22:03,157 INFO L175 Difference]: Start difference. First operand has 63 places, 40 transitions, 132 flow. Second operand 7 states and 183 transitions. [2025-03-08 17:22:03,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 124 transitions, 583 flow [2025-03-08 17:22:04,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 124 transitions, 549 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-03-08 17:22:04,098 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 137 flow [2025-03-08 17:22:04,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2025-03-08 17:22:04,098 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2025-03-08 17:22:04,098 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 137 flow [2025-03-08 17:22:04,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-08 17:22:04,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:22:04,099 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] [2025-03-08 17:22:04,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:22:04,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 17:22:04,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:22:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1507905422, now seen corresponding path program 1 times [2025-03-08 17:22:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:22:04,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961932898] [2025-03-08 17:22:04,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:22:04,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:22:04,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 17:22:04,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:22:04,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:22:04,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:22:04,316 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-08 17:22:04,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:22:04,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961932898] [2025-03-08 17:22:04,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961932898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:22:04,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:22:04,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:22:04,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765641640] [2025-03-08 17:22:04,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:22:04,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:22:04,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:22:04,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:22:04,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:22:04,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-08 17:22:04,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-08 17:22:04,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:22:04,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-08 17:22:04,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:22:09,323 INFO L124 PetriNetUnfolderBase]: 51907/70379 cut-off events. [2025-03-08 17:22:09,323 INFO L125 PetriNetUnfolderBase]: For 48992/49045 co-relation queries the response was YES. [2025-03-08 17:22:09,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166619 conditions, 70379 events. 51907/70379 cut-off events. For 48992/49045 co-relation queries the response was YES. Maximal size of possible extension queue 2152. Compared 433330 event pairs, 7505 based on Foata normal form. 930/71258 useless extension candidates. Maximal degree in co-relation 166599. Up to 34381 conditions per place. [2025-03-08 17:22:09,696 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 60 selfloop transitions, 4 changer transitions 42/111 dead transitions. [2025-03-08 17:22:09,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 111 transitions, 546 flow [2025-03-08 17:22:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:22:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:22:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2025-03-08 17:22:09,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-08 17:22:09,698 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 137 flow. Second operand 6 states and 161 transitions. [2025-03-08 17:22:09,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 111 transitions, 546 flow [2025-03-08 17:22:10,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 111 transitions, 519 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-08 17:22:10,993 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 139 flow [2025-03-08 17:22:10,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2025-03-08 17:22:10,993 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-08 17:22:10,994 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 139 flow [2025-03-08 17:22:10,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-08 17:22:10,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:22:10,994 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] [2025-03-08 17:22:10,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:22:10,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 17:22:10,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:22:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 45501838, now seen corresponding path program 2 times [2025-03-08 17:22:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:22:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899546212] [2025-03-08 17:22:10,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:22:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:22:11,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-08 17:22:11,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:22:11,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:22:11,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:22:11,638 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-08 17:22:11,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:22:11,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899546212] [2025-03-08 17:22:11,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899546212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:22:11,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:22:11,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:22:11,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446427652] [2025-03-08 17:22:11,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:22:11,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:22:11,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:22:11,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:22:11,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:22:11,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-03-08 17:22:11,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 40 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-08 17:22:11,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:22:11,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-03-08 17:22:11,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:22:16,406 INFO L124 PetriNetUnfolderBase]: 36774/49990 cut-off events. [2025-03-08 17:22:16,406 INFO L125 PetriNetUnfolderBase]: For 25961/25961 co-relation queries the response was YES. [2025-03-08 17:22:16,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118055 conditions, 49990 events. 36774/49990 cut-off events. For 25961/25961 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 291243 event pairs, 13249 based on Foata normal form. 1077/51065 useless extension candidates. Maximal degree in co-relation 118035. Up to 32578 conditions per place. [2025-03-08 17:22:16,732 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 86 selfloop transitions, 9 changer transitions 83/183 dead transitions. [2025-03-08 17:22:16,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 183 transitions, 931 flow [2025-03-08 17:22:16,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:22:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:22:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 274 transitions. [2025-03-08 17:22:16,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.541501976284585 [2025-03-08 17:22:16,733 INFO L175 Difference]: Start difference. First operand has 63 places, 40 transitions, 139 flow. Second operand 11 states and 274 transitions. [2025-03-08 17:22:16,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 183 transitions, 931 flow [2025-03-08 17:22:17,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 183 transitions, 891 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-08 17:22:17,115 INFO L231 Difference]: Finished difference. Result has 75 places, 47 transitions, 213 flow [2025-03-08 17:22:17,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=213, PETRI_PLACES=75, PETRI_TRANSITIONS=47} [2025-03-08 17:22:17,115 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2025-03-08 17:22:17,116 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 47 transitions, 213 flow [2025-03-08 17:22:17,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-08 17:22:17,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:22:17,116 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] [2025-03-08 17:22:17,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:22:17,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 17:22:17,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:22:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1050365106, now seen corresponding path program 1 times [2025-03-08 17:22:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:22:17,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226721562] [2025-03-08 17:22:17,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:22:17,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:22:17,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:22:17,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:22:17,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:22:17,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:22:17,263 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-08 17:22:17,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:22:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226721562] [2025-03-08 17:22:17,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226721562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:22:17,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:22:17,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:22:17,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068162374] [2025-03-08 17:22:17,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:22:17,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:22:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:22:17,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:22:17,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:22:17,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2025-03-08 17:22:17,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 47 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-08 17:22:17,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:22:17,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2025-03-08 17:22:17,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:22:21,124 INFO L124 PetriNetUnfolderBase]: 29693/41327 cut-off events. [2025-03-08 17:22:21,124 INFO L125 PetriNetUnfolderBase]: For 66297/66307 co-relation queries the response was YES. [2025-03-08 17:22:21,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127599 conditions, 41327 events. 29693/41327 cut-off events. For 66297/66307 co-relation queries the response was YES. Maximal size of possible extension queue 1417. Compared 255899 event pairs, 3886 based on Foata normal form. 1572/42892 useless extension candidates. Maximal degree in co-relation 127573. Up to 21977 conditions per place. [2025-03-08 17:22:21,419 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 86 selfloop transitions, 6 changer transitions 3/101 dead transitions. [2025-03-08 17:22:21,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 657 flow [2025-03-08 17:22:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:22:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:22:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-08 17:22:21,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2025-03-08 17:22:21,421 INFO L175 Difference]: Start difference. First operand has 75 places, 47 transitions, 213 flow. Second operand 4 states and 116 transitions. [2025-03-08 17:22:21,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 657 flow [2025-03-08 17:22:21,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 101 transitions, 632 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-08 17:22:21,619 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 240 flow [2025-03-08 17:22:21,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2025-03-08 17:22:21,619 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2025-03-08 17:22:21,619 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 240 flow [2025-03-08 17:22:21,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-08 17:22:21,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:22:21,620 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] [2025-03-08 17:22:21,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:22:21,620 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 17:22:21,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:22:21,620 INFO L85 PathProgramCache]: Analyzing trace with hash -276376953, now seen corresponding path program 1 times [2025-03-08 17:22:21,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:22:21,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175472162] [2025-03-08 17:22:21,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:22:21,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:22:21,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:22:21,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:22:21,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:22:21,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:22:21,861 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-08 17:22:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:22:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175472162] [2025-03-08 17:22:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175472162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:22:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:22:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:22:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565212594] [2025-03-08 17:22:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:22:21,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:22:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:22:21,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:22:21,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:22:21,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2025-03-08 17:22:21,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 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-08 17:22:21,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:22:21,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2025-03-08 17:22:21,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand