./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe016_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/safe016_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 6b69d29db6700923687b32c5d8fab6e8f05fe2198d87348098263d957793e472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:34:32,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:34:32,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:34:32,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:34:32,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:34:32,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:34:32,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:34:32,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:34:32,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:34:32,308 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:34:32,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:34:32,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:34:32,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:34:32,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:34:32,310 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:34:32,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:34:32,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:34:32,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:34:32,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:34:32,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:34:32,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:34:32,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:34:32,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:34:32,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:34:32,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:34:32,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:34:32,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:34:32,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:34:32,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:34:32,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:34:32,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:34:32,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:34:32,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:34:32,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:34:32,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:34:32,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:34:32,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:34:32,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:34:32,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:34:32,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:34:32,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:34:32,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:34:32,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:34:32,313 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 -> 6b69d29db6700923687b32c5d8fab6e8f05fe2198d87348098263d957793e472 [2025-03-13 21:34:32,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:34:32,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:34:32,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:34:32,535 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:34:32,535 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:34:32,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe016_power.opt.i [2025-03-13 21:34:33,677 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee37d3d42/9525be51a3b84858a585f3676fe82c8d/FLAGbcdb92b08 [2025-03-13 21:34:33,965 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:34:33,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_power.opt.i [2025-03-13 21:34:33,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee37d3d42/9525be51a3b84858a585f3676fe82c8d/FLAGbcdb92b08 [2025-03-13 21:34:34,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee37d3d42/9525be51a3b84858a585f3676fe82c8d [2025-03-13 21:34:34,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:34:34,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:34:34,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:34:34,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:34:34,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:34:34,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5500ab2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34, skipping insertion in model container [2025-03-13 21:34:34,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:34:34,410 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/safe016_power.opt.i[951,964] [2025-03-13 21:34:34,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:34:34,600 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:34:34,607 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/safe016_power.opt.i[951,964] [2025-03-13 21:34:34,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:34:34,679 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:34:34,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34 WrapperNode [2025-03-13 21:34:34,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:34:34,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:34:34,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:34:34,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:34:34,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,722 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2025-03-13 21:34:34,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:34:34,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:34:34,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:34:34,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:34:34,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,747 INFO L175 MemorySlicer]: Split 30 memory accesses to 2 slices as follows [2, 28]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2025-03-13 21:34:34,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:34:34,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:34:34,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:34:34,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:34:34,764 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (1/1) ... [2025-03-13 21:34:34,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:34:34,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:34:34,788 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-13 21:34:34,790 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-13 21:34:34,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:34:34,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:34:34,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:34:34,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:34:34,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:34:34,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:34:34,810 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-13 21:34:34,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-13 21:34:34,810 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-13 21:34:34,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-13 21:34:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-13 21:34:34,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-13 21:34:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-13 21:34:34,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-13 21:34:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:34:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:34:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:34:34,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:34:34,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:34:34,813 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:34:34,927 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:34:34,928 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:34:35,288 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:34:35,288 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:34:35,289 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:34:35,663 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:34:35,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:34:35 BoogieIcfgContainer [2025-03-13 21:34:35,664 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:34:35,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:34:35,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:34:35,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:34:35,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:34:34" (1/3) ... [2025-03-13 21:34:35,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afcd9e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:34:35, skipping insertion in model container [2025-03-13 21:34:35,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:34:34" (2/3) ... [2025-03-13 21:34:35,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afcd9e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:34:35, skipping insertion in model container [2025-03-13 21:34:35,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:34:35" (3/3) ... [2025-03-13 21:34:35,671 INFO L128 eAbstractionObserver]: Analyzing ICFG safe016_power.opt.i [2025-03-13 21:34:35,683 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:34:35,684 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe016_power.opt.i that has 5 procedures, 45 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-13 21:34:35,684 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:34:35,772 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:34:35,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 106 flow [2025-03-13 21:34:35,834 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2025-03-13 21:34:35,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:34:35,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 1/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-03-13 21:34:35,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 45 transitions, 106 flow [2025-03-13 21:34:35,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2025-03-13 21:34:35,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:34:35,857 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;@62a9cc4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:34:35,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:34:35,874 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:34:35,875 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-03-13 21:34:35,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:34:35,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:35,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:34:35,876 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 2 more)] === [2025-03-13 21:34:35,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:35,880 INFO L85 PathProgramCache]: Analyzing trace with hash -306900643, now seen corresponding path program 1 times [2025-03-13 21:34:35,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98602377] [2025-03-13 21:34:35,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:35,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:35,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:34:36,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:34:36,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:36,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:36,624 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-13 21:34:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:36,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98602377] [2025-03-13 21:34:36,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98602377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:36,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:36,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:34:36,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638260092] [2025-03-13 21:34:36,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:36,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:34:36,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:36,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:34:36,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:34:36,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-13 21:34:36,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 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-13 21:34:36,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:36,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-13 21:34:36,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:40,917 INFO L124 PetriNetUnfolderBase]: 28003/38155 cut-off events. [2025-03-13 21:34:40,917 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-03-13 21:34:40,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75851 conditions, 38155 events. 28003/38155 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 225046 event pairs, 6435 based on Foata normal form. 900/38988 useless extension candidates. Maximal degree in co-relation 75839. Up to 28979 conditions per place. [2025-03-13 21:34:41,104 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 48 selfloop transitions, 3 changer transitions 63/119 dead transitions. [2025-03-13 21:34:41,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 119 transitions, 481 flow [2025-03-13 21:34:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:34:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:34:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2025-03-13 21:34:41,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5682539682539682 [2025-03-13 21:34:41,116 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 7 states and 179 transitions. [2025-03-13 21:34:41,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 119 transitions, 481 flow [2025-03-13 21:34:41,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 119 transitions, 476 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:34:41,134 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 119 flow [2025-03-13 21:34:41,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2025-03-13 21:34:41,140 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2025-03-13 21:34:41,141 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 119 flow [2025-03-13 21:34:41,141 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-13 21:34:41,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:41,141 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-13 21:34:41,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:34:41,142 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 2 more)] === [2025-03-13 21:34:41,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:41,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2122714712, now seen corresponding path program 1 times [2025-03-13 21:34:41,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:41,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383360874] [2025-03-13 21:34:41,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:41,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:41,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:34:41,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:34:41,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:41,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:41,387 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-13 21:34:41,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:41,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383360874] [2025-03-13 21:34:41,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383360874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:41,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:41,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:34:41,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684084768] [2025-03-13 21:34:41,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:41,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:34:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:41,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:34:41,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:34:41,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-13 21:34:41,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 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-13 21:34:41,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:41,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-13 21:34:41,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:44,962 INFO L124 PetriNetUnfolderBase]: 26276/35701 cut-off events. [2025-03-13 21:34:44,962 INFO L125 PetriNetUnfolderBase]: For 16800/16813 co-relation queries the response was YES. [2025-03-13 21:34:45,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84313 conditions, 35701 events. 26276/35701 cut-off events. For 16800/16813 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 212593 event pairs, 3362 based on Foata normal form. 840/36530 useless extension candidates. Maximal degree in co-relation 84298. Up to 25961 conditions per place. [2025-03-13 21:34:45,302 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 58 selfloop transitions, 2 changer transitions 65/130 dead transitions. [2025-03-13 21:34:45,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 130 transitions, 631 flow [2025-03-13 21:34:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:34:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:34:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2025-03-13 21:34:45,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-03-13 21:34:45,304 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 119 flow. Second operand 7 states and 186 transitions. [2025-03-13 21:34:45,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 130 transitions, 631 flow [2025-03-13 21:34:45,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 130 transitions, 618 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-13 21:34:45,496 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 128 flow [2025-03-13 21:34:45,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, 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-13 21:34:45,497 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2025-03-13 21:34:45,497 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 128 flow [2025-03-13 21:34:45,497 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-13 21:34:45,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:45,497 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-13 21:34:45,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:34:45,497 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 2 more)] === [2025-03-13 21:34:45,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1515242111, now seen corresponding path program 1 times [2025-03-13 21:34:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378613509] [2025-03-13 21:34:45,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:45,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:45,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:34:45,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:34:45,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:45,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:45,811 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-13 21:34:45,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:45,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378613509] [2025-03-13 21:34:45,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378613509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:45,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:45,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:34:45,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785968903] [2025-03-13 21:34:45,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:45,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:34:45,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:45,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:34:45,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:34:45,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-13 21:34:45,816 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-13 21:34:45,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:45,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-13 21:34:45,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:49,346 INFO L124 PetriNetUnfolderBase]: 23847/32415 cut-off events. [2025-03-13 21:34:49,346 INFO L125 PetriNetUnfolderBase]: For 19872/19872 co-relation queries the response was YES. [2025-03-13 21:34:49,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79596 conditions, 32415 events. 23847/32415 cut-off events. For 19872/19872 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 179400 event pairs, 6007 based on Foata normal form. 600/32978 useless extension candidates. Maximal degree in co-relation 79577. Up to 24496 conditions per place. [2025-03-13 21:34:49,581 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 52 selfloop transitions, 2 changer transitions 57/116 dead transitions. [2025-03-13 21:34:49,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 537 flow [2025-03-13 21:34:49,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:34:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:34:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-03-13 21:34:49,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-03-13 21:34:49,582 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 128 flow. Second operand 7 states and 174 transitions. [2025-03-13 21:34:49,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 537 flow [2025-03-13 21:34:50,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 116 transitions, 515 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-13 21:34:50,045 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 132 flow [2025-03-13 21:34:50,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, 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-13 21:34:50,046 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2025-03-13 21:34:50,047 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 132 flow [2025-03-13 21:34:50,047 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-13 21:34:50,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:50,047 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-13 21:34:50,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:34:50,047 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 2 more)] === [2025-03-13 21:34:50,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2110626696, now seen corresponding path program 1 times [2025-03-13 21:34:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:50,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178718542] [2025-03-13 21:34:50,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:50,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:34:50,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:34:50,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:50,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:50,361 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-13 21:34:50,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:50,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178718542] [2025-03-13 21:34:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178718542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:50,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:50,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:34:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349406516] [2025-03-13 21:34:50,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:50,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:34:50,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:50,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:34:50,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:34:50,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-13 21:34:50,367 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-13 21:34:50,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:50,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-13 21:34:50,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:54,148 INFO L124 PetriNetUnfolderBase]: 35112/47504 cut-off events. [2025-03-13 21:34:54,148 INFO L125 PetriNetUnfolderBase]: For 28099/28177 co-relation queries the response was YES. [2025-03-13 21:34:54,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114449 conditions, 47504 events. 35112/47504 cut-off events. For 28099/28177 co-relation queries the response was YES. Maximal size of possible extension queue 1394. Compared 280818 event pairs, 13830 based on Foata normal form. 948/48385 useless extension candidates. Maximal degree in co-relation 114429. Up to 22124 conditions per place. [2025-03-13 21:34:54,413 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 55 selfloop transitions, 3 changer transitions 61/124 dead transitions. [2025-03-13 21:34:54,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 124 transitions, 583 flow [2025-03-13 21:34:54,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:34:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:34:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2025-03-13 21:34:54,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-03-13 21:34:54,415 INFO L175 Difference]: Start difference. First operand has 63 places, 40 transitions, 132 flow. Second operand 7 states and 183 transitions. [2025-03-13 21:34:54,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 124 transitions, 583 flow [2025-03-13 21:34:55,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 124 transitions, 549 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-03-13 21:34:55,579 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 137 flow [2025-03-13 21:34:55,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, 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-13 21:34:55,580 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-03-13 21:34:55,580 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 137 flow [2025-03-13 21:34:55,580 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-13 21:34:55,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:55,580 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-13 21:34:55,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:34:55,580 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 2 more)] === [2025-03-13 21:34:55,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash 622692384, now seen corresponding path program 1 times [2025-03-13 21:34:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:55,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205185607] [2025-03-13 21:34:55,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:55,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:55,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:34:55,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:34:55,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:55,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:55,820 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-13 21:34:55,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:55,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205185607] [2025-03-13 21:34:55,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205185607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:55,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:55,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:34:55,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71722233] [2025-03-13 21:34:55,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:55,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:34:55,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:55,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:34:55,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:34:55,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-13 21:34:55,826 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-13 21:34:55,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:55,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-13 21:34:55,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:35:02,250 INFO L124 PetriNetUnfolderBase]: 51907/70399 cut-off events. [2025-03-13 21:35:02,251 INFO L125 PetriNetUnfolderBase]: For 49085/49163 co-relation queries the response was YES. [2025-03-13 21:35:02,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166639 conditions, 70399 events. 51907/70399 cut-off events. For 49085/49163 co-relation queries the response was YES. Maximal size of possible extension queue 2155. Compared 433590 event pairs, 7505 based on Foata normal form. 948/71280 useless extension candidates. Maximal degree in co-relation 166619. Up to 34381 conditions per place. [2025-03-13 21:35:02,626 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 60 selfloop transitions, 4 changer transitions 42/111 dead transitions. [2025-03-13 21:35:02,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 111 transitions, 546 flow [2025-03-13 21:35:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:35:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:35:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2025-03-13 21:35:02,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5962962962962963 [2025-03-13 21:35:02,627 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 137 flow. Second operand 6 states and 161 transitions. [2025-03-13 21:35:02,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 111 transitions, 546 flow [2025-03-13 21:35:03,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 111 transitions, 519 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-13 21:35:03,643 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 139 flow [2025-03-13 21:35:03,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, 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-13 21:35:03,644 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2025-03-13 21:35:03,644 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 139 flow [2025-03-13 21:35:03,644 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-13 21:35:03,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:35:03,644 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-13 21:35:03,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:35:03,644 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 2 more)] === [2025-03-13 21:35:03,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:35:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1470813088, now seen corresponding path program 2 times [2025-03-13 21:35:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:35:03,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877075946] [2025-03-13 21:35:03,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:35:03,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:35:03,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:35:03,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:35:03,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:35:03,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:35:04,400 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-13 21:35:04,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:35:04,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877075946] [2025-03-13 21:35:04,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877075946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:35:04,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:35:04,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:35:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015438786] [2025-03-13 21:35:04,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:35:04,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:35:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:35:04,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:35:04,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:35:04,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-13 21:35:04,406 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-13 21:35:04,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:35:04,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-13 21:35:04,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:35:07,669 INFO L124 PetriNetUnfolderBase]: 32987/45171 cut-off events. [2025-03-13 21:35:07,669 INFO L125 PetriNetUnfolderBase]: For 26807/26810 co-relation queries the response was YES. [2025-03-13 21:35:07,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106729 conditions, 45171 events. 32987/45171 cut-off events. For 26807/26810 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 269780 event pairs, 8905 based on Foata normal form. 900/46069 useless extension candidates. Maximal degree in co-relation 106709. Up to 36413 conditions per place. [2025-03-13 21:35:07,943 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 53 selfloop transitions, 3 changer transitions 52/113 dead transitions. [2025-03-13 21:35:07,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 113 transitions, 582 flow [2025-03-13 21:35:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:35:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:35:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2025-03-13 21:35:07,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5365079365079365 [2025-03-13 21:35:07,944 INFO L175 Difference]: Start difference. First operand has 63 places, 40 transitions, 139 flow. Second operand 7 states and 169 transitions. [2025-03-13 21:35:07,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 113 transitions, 582 flow [2025-03-13 21:35:08,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 113 transitions, 556 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-13 21:35:08,162 INFO L231 Difference]: Finished difference. Result has 67 places, 42 transitions, 160 flow [2025-03-13 21:35:08,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=67, PETRI_TRANSITIONS=42} [2025-03-13 21:35:08,163 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2025-03-13 21:35:08,163 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 160 flow [2025-03-13 21:35:08,163 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-13 21:35:08,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:35:08,163 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] [2025-03-13 21:35:08,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:35:08,163 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 2 more)] === [2025-03-13 21:35:08,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:35:08,164 INFO L85 PathProgramCache]: Analyzing trace with hash 209856142, now seen corresponding path program 1 times [2025-03-13 21:35:08,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:35:08,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131818295] [2025-03-13 21:35:08,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:35:08,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:35:08,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:35:08,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:35:08,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:35:08,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:35:08,515 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-13 21:35:08,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:35:08,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131818295] [2025-03-13 21:35:08,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131818295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:35:08,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:35:08,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:35:08,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460064106] [2025-03-13 21:35:08,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:35:08,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:35:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:35:08,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:35:08,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:35:08,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-13 21:35:08,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 42 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-13 21:35:08,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:35:08,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-13 21:35:08,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand