./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix004.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix004.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:58:13,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:58:13,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 00:58:13,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:58:13,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:58:13,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:58:13,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:58:13,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:58:13,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:58:13,494 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:58:13,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:58:13,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:58:13,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:58:13,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:58:13,495 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:58:13,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:58:13,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:58:13,495 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 00:58:13,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:58:13,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 00:58:13,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:58:13,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:58:13,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:58:13,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:58:13,496 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 00:58:13,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:58:13,496 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:58:13,496 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:58:13,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:58:13,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:58:13,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:58:13,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:58:13,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:58:13,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:58:13,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:58:13,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:58:13,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:58:13,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:58:13,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:58:13,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:58:13,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:58:13,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:58:13,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:58:13,497 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-jdk21/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 -> 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d [2025-02-08 00:58:13,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:58:13,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:58:13,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:58:13,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:58:13,749 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:58:13,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix004.opt.i [2025-02-08 00:58:14,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08b338930/eee133c44eb1497494ac4d221173fe27/FLAG087fc47fc [2025-02-08 00:58:15,196 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:58:15,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2025-02-08 00:58:15,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08b338930/eee133c44eb1497494ac4d221173fe27/FLAG087fc47fc [2025-02-08 00:58:15,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08b338930/eee133c44eb1497494ac4d221173fe27 [2025-02-08 00:58:15,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:58:15,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:58:15,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:58:15,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:58:15,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:58:15,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3800c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15, skipping insertion in model container [2025-02-08 00:58:15,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:58:15,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i[944,957] [2025-02-08 00:58:15,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:58:15,620 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:58:15,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i[944,957] [2025-02-08 00:58:15,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:58:15,679 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:58:15,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15 WrapperNode [2025-02-08 00:58:15,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:58:15,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:58:15,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:58:15,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:58:15,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,709 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2025-02-08 00:58:15,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:58:15,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:58:15,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:58:15,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:58:15,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,727 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:58:15,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:58:15,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:58:15,741 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:58:15,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:58:15,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (1/1) ... [2025-02-08 00:58:15,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:58:15,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:58:15,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:58:15,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:58:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 00:58:15,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:58:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 00:58:15,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 00:58:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 00:58:15,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 00:58:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 00:58:15,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 00:58:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-02-08 00:58:15,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-02-08 00:58:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:58:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 00:58:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:58:15,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:58:15,787 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 00:58:15,872 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:58:15,873 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:58:16,130 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 00:58:16,130 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:58:16,348 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:58:16,348 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:58:16,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:58:16 BoogieIcfgContainer [2025-02-08 00:58:16,348 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:58:16,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:58:16,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:58:16,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:58:16,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:58:15" (1/3) ... [2025-02-08 00:58:16,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2f35c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:58:16, skipping insertion in model container [2025-02-08 00:58:16,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:58:15" (2/3) ... [2025-02-08 00:58:16,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2f35c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:58:16, skipping insertion in model container [2025-02-08 00:58:16,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:58:16" (3/3) ... [2025-02-08 00:58:16,358 INFO L128 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2025-02-08 00:58:16,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:58:16,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix004.opt.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-08 00:58:16,372 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 00:58:16,426 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:58:16,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2025-02-08 00:58:16,484 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-02-08 00:58:16,486 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:58:16,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2025-02-08 00:58:16,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2025-02-08 00:58:16,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2025-02-08 00:58:16,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:58:16,522 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;@74062c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:58:16,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 00:58:16,533 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:58:16,536 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-02-08 00:58:16,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:58:16,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:58:16,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:58:16,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:58:16,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:58:16,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1842669731, now seen corresponding path program 1 times [2025-02-08 00:58:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:58:16,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449267346] [2025-02-08 00:58:16,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:58:16,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:58:16,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 00:58:16,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 00:58:16,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:58:16,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:58:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:58:16,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:58:16,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449267346] [2025-02-08 00:58:16,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449267346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:58:16,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:58:16,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 00:58:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995135303] [2025-02-08 00:58:16,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:58:17,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 00:58:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:58:17,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 00:58:17,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 00:58:17,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 00:58:17,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-02-08 00:58:17,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:58:17,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 00:58:17,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:58:21,253 INFO L124 PetriNetUnfolderBase]: 47351/62857 cut-off events. [2025-02-08 00:58:21,253 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-02-08 00:58:21,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125505 conditions, 62857 events. 47351/62857 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 1844. Compared 364614 event pairs, 6239 based on Foata normal form. 1764/64285 useless extension candidates. Maximal degree in co-relation 125493. Up to 53209 conditions per place. [2025-02-08 00:58:21,842 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 56 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2025-02-08 00:58:21,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 266 flow [2025-02-08 00:58:21,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 00:58:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 00:58:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-02-08 00:58:21,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-02-08 00:58:21,852 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 96 transitions. [2025-02-08 00:58:21,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 266 flow [2025-02-08 00:58:21,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 262 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 00:58:21,861 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2025-02-08 00:58:21,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-02-08 00:58:21,864 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-02-08 00:58:21,865 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2025-02-08 00:58:21,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-02-08 00:58:21,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:58:21,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:58:21,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:58:21,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:58:21,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:58:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash -702981476, now seen corresponding path program 1 times [2025-02-08 00:58:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:58:21,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909229768] [2025-02-08 00:58:21,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:58:21,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:58:21,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 00:58:21,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 00:58:21,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:58:21,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:58:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:58:22,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:58:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909229768] [2025-02-08 00:58:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909229768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:58:22,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:58:22,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:58:22,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074247450] [2025-02-08 00:58:22,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:58:22,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:58:22,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:58:22,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:58:22,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:58:22,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-08 00:58:22,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 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-02-08 00:58:22,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:58:22,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-08 00:58:22,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:58:27,228 INFO L124 PetriNetUnfolderBase]: 69203/92659 cut-off events. [2025-02-08 00:58:27,229 INFO L125 PetriNetUnfolderBase]: For 2992/2992 co-relation queries the response was YES. [2025-02-08 00:58:27,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187141 conditions, 92659 events. 69203/92659 cut-off events. For 2992/2992 co-relation queries the response was YES. Maximal size of possible extension queue 2665. Compared 572696 event pairs, 35807 based on Foata normal form. 0/90896 useless extension candidates. Maximal degree in co-relation 187131. Up to 61525 conditions per place. [2025-02-08 00:58:27,640 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 50 selfloop transitions, 5 changer transitions 88/148 dead transitions. [2025-02-08 00:58:27,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 148 transitions, 612 flow [2025-02-08 00:58:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:58:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 00:58:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2025-02-08 00:58:27,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5425 [2025-02-08 00:58:27,645 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 8 states and 217 transitions. [2025-02-08 00:58:27,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 148 transitions, 612 flow [2025-02-08 00:58:27,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 148 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 00:58:27,656 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 149 flow [2025-02-08 00:58:27,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=149, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2025-02-08 00:58:27,657 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2025-02-08 00:58:27,657 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 149 flow [2025-02-08 00:58:27,657 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-02-08 00:58:27,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:58:27,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:58:27,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:58:27,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:58:27,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:58:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1890924355, now seen corresponding path program 1 times [2025-02-08 00:58:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:58:27,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778500390] [2025-02-08 00:58:27,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:58:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:58:27,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 00:58:27,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 00:58:27,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:58:27,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:58:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:58:27,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:58:27,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778500390] [2025-02-08 00:58:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778500390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:58:27,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:58:27,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:58:27,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971947646] [2025-02-08 00:58:27,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:58:27,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:58:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:58:27,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:58:27,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:58:27,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-08 00:58:27,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-02-08 00:58:27,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:58:27,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-08 00:58:27,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:58:32,756 INFO L124 PetriNetUnfolderBase]: 52299/70181 cut-off events. [2025-02-08 00:58:32,756 INFO L125 PetriNetUnfolderBase]: For 52957/52957 co-relation queries the response was YES. [2025-02-08 00:58:32,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178272 conditions, 70181 events. 52299/70181 cut-off events. For 52957/52957 co-relation queries the response was YES. Maximal size of possible extension queue 1960. Compared 427279 event pairs, 10779 based on Foata normal form. 1708/71848 useless extension candidates. Maximal degree in co-relation 178257. Up to 44905 conditions per place. [2025-02-08 00:58:33,172 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 60 selfloop transitions, 3 changer transitions 79/147 dead transitions. [2025-02-08 00:58:33,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 147 transitions, 749 flow [2025-02-08 00:58:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:58:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 00:58:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2025-02-08 00:58:33,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-02-08 00:58:33,175 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 149 flow. Second operand 7 states and 203 transitions. [2025-02-08 00:58:33,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 147 transitions, 749 flow [2025-02-08 00:58:34,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 147 transitions, 736 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 00:58:34,537 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 159 flow [2025-02-08 00:58:34,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2025-02-08 00:58:34,538 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-02-08 00:58:34,538 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 159 flow [2025-02-08 00:58:34,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-02-08 00:58:34,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:58:34,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:58:34,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:58:34,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:58:34,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:58:34,539 INFO L85 PathProgramCache]: Analyzing trace with hash -864433201, now seen corresponding path program 1 times [2025-02-08 00:58:34,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:58:34,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944550014] [2025-02-08 00:58:34,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:58:34,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:58:34,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 00:58:34,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 00:58:34,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:58:34,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:58:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:58:34,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:58:34,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944550014] [2025-02-08 00:58:34,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944550014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:58:34,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:58:34,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:58:34,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008944685] [2025-02-08 00:58:34,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:58:34,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:58:34,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:58:34,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:58:34,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:58:34,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-08 00:58:34,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-02-08 00:58:34,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:58:34,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-08 00:58:34,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:58:38,735 INFO L124 PetriNetUnfolderBase]: 45755/61321 cut-off events. [2025-02-08 00:58:38,735 INFO L125 PetriNetUnfolderBase]: For 60469/60469 co-relation queries the response was YES. [2025-02-08 00:58:38,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159762 conditions, 61321 events. 45755/61321 cut-off events. For 60469/60469 co-relation queries the response was YES. Maximal size of possible extension queue 1563. Compared 354808 event pairs, 10095 based on Foata normal form. 1260/62536 useless extension candidates. Maximal degree in co-relation 159743. Up to 38761 conditions per place. [2025-02-08 00:58:39,116 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 58 selfloop transitions, 3 changer transitions 71/137 dead transitions. [2025-02-08 00:58:39,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 137 transitions, 702 flow [2025-02-08 00:58:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:58:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 00:58:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions. [2025-02-08 00:58:39,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5514285714285714 [2025-02-08 00:58:39,122 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 159 flow. Second operand 7 states and 193 transitions. [2025-02-08 00:58:39,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 137 transitions, 702 flow [2025-02-08 00:58:40,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 137 transitions, 678 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 00:58:40,278 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 164 flow [2025-02-08 00:58:40,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-02-08 00:58:40,279 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-02-08 00:58:40,279 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 164 flow [2025-02-08 00:58:40,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-02-08 00:58:40,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:58:40,279 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-02-08 00:58:40,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:58:40,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:58:40,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:58:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2140834913, now seen corresponding path program 1 times [2025-02-08 00:58:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:58:40,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107098763] [2025-02-08 00:58:40,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:58:40,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:58:40,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 00:58:40,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 00:58:40,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:58:40,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:58:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:58:40,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:58:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107098763] [2025-02-08 00:58:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107098763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:58:40,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:58:40,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:58:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006120950] [2025-02-08 00:58:40,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:58:40,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:58:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:58:40,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:58:40,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:58:40,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 00:58:40,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 164 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-02-08 00:58:40,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:58:40,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 00:58:40,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:58:43,551 INFO L124 PetriNetUnfolderBase]: 34215/47245 cut-off events. [2025-02-08 00:58:43,551 INFO L125 PetriNetUnfolderBase]: For 46617/46617 co-relation queries the response was YES. [2025-02-08 00:58:43,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123247 conditions, 47245 events. 34215/47245 cut-off events. For 46617/46617 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 289947 event pairs, 4831 based on Foata normal form. 1764/48976 useless extension candidates. Maximal degree in co-relation 123227. Up to 23653 conditions per place. [2025-02-08 00:58:43,890 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 81 selfloop transitions, 6 changer transitions 1/94 dead transitions. [2025-02-08 00:58:43,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 498 flow [2025-02-08 00:58:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:58:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 00:58:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-02-08 00:58:43,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-02-08 00:58:43,892 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 164 flow. Second operand 4 states and 130 transitions. [2025-02-08 00:58:43,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 498 flow [2025-02-08 00:58:44,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 480 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-02-08 00:58:44,083 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 192 flow [2025-02-08 00:58:44,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2025-02-08 00:58:44,084 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2025-02-08 00:58:44,084 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 192 flow [2025-02-08 00:58:44,084 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-02-08 00:58:44,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:58:44,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:58:44,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:58:44,085 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:58:44,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:58:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash 149420665, now seen corresponding path program 1 times [2025-02-08 00:58:44,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:58:44,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027371263] [2025-02-08 00:58:44,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:58:44,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:58:44,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 00:58:44,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 00:58:44,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:58:44,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:58:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:58:44,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:58:44,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027371263] [2025-02-08 00:58:44,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027371263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:58:44,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:58:44,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:58:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304424622] [2025-02-08 00:58:44,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:58:44,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:58:44,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:58:44,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:58:44,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:58:44,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 00:58:44,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-02-08 00:58:44,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:58:44,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 00:58:44,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:58:46,046 INFO L124 PetriNetUnfolderBase]: 23291/32417 cut-off events. [2025-02-08 00:58:46,046 INFO L125 PetriNetUnfolderBase]: For 31091/31091 co-relation queries the response was YES. [2025-02-08 00:58:46,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90085 conditions, 32417 events. 23291/32417 cut-off events. For 31091/31091 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 189521 event pairs, 2819 based on Foata normal form. 1364/33748 useless extension candidates. Maximal degree in co-relation 90067. Up to 10777 conditions per place. [2025-02-08 00:58:46,246 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 10 changer transitions 1/121 dead transitions. [2025-02-08 00:58:46,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 121 transitions, 671 flow [2025-02-08 00:58:46,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:58:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 00:58:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-02-08 00:58:46,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672 [2025-02-08 00:58:46,248 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 192 flow. Second operand 5 states and 168 transitions. [2025-02-08 00:58:46,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 121 transitions, 671 flow [2025-02-08 00:58:46,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 121 transitions, 660 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 00:58:46,259 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 244 flow [2025-02-08 00:58:46,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2025-02-08 00:58:46,260 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-02-08 00:58:46,260 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 244 flow [2025-02-08 00:58:46,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-02-08 00:58:46,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:58:46,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:58:46,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:58:46,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:58:46,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:58:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash -887889955, now seen corresponding path program 1 times [2025-02-08 00:58:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:58:46,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237428178] [2025-02-08 00:58:46,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:58:46,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:58:46,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 00:58:46,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 00:58:46,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:58:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:58:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:58:46,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:58:46,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237428178] [2025-02-08 00:58:46,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237428178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:58:46,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:58:46,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:58:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757146339] [2025-02-08 00:58:46,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:58:46,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:58:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:58:46,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:58:46,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:58:46,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 00:58:46,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-02-08 00:58:46,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:58:46,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 00:58:46,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:58:48,038 INFO L124 PetriNetUnfolderBase]: 15067/20853 cut-off events. [2025-02-08 00:58:48,038 INFO L125 PetriNetUnfolderBase]: For 28723/28723 co-relation queries the response was YES. [2025-02-08 00:58:48,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61653 conditions, 20853 events. 15067/20853 cut-off events. For 28723/28723 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 112703 event pairs, 2429 based on Foata normal form. 644/21464 useless extension candidates. Maximal degree in co-relation 61633. Up to 6400 conditions per place. [2025-02-08 00:58:48,122 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 125 selfloop transitions, 14 changer transitions 1/146 dead transitions. [2025-02-08 00:58:48,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 146 transitions, 860 flow [2025-02-08 00:58:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:58:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 00:58:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-02-08 00:58:48,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-02-08 00:58:48,123 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 244 flow. Second operand 6 states and 204 transitions. [2025-02-08 00:58:48,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 146 transitions, 860 flow [2025-02-08 00:58:48,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 146 transitions, 830 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 00:58:48,260 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 294 flow [2025-02-08 00:58:48,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-02-08 00:58:48,261 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-02-08 00:58:48,261 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 294 flow [2025-02-08 00:58:48,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-02-08 00:58:48,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:58:48,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:58:48,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:58:48,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:58:48,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:58:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash -999699483, now seen corresponding path program 1 times [2025-02-08 00:58:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:58:48,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442051954] [2025-02-08 00:58:48,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:58:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:58:48,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 00:58:48,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 00:58:48,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:58:48,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:58:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:58:48,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:58:48,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442051954] [2025-02-08 00:58:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442051954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:58:48,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:58:48,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:58:48,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005734402] [2025-02-08 00:58:48,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:58:48,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:58:48,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:58:48,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:58:48,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:58:48,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-08 00:58:48,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 294 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02-08 00:58:48,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:58:48,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-08 00:58:48,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:58:50,622 INFO L124 PetriNetUnfolderBase]: 19947/27452 cut-off events. [2025-02-08 00:58:50,622 INFO L125 PetriNetUnfolderBase]: For 39178/39178 co-relation queries the response was YES. [2025-02-08 00:58:50,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83205 conditions, 27452 events. 19947/27452 cut-off events. For 39178/39178 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 149246 event pairs, 4909 based on Foata normal form. 112/27550 useless extension candidates. Maximal degree in co-relation 83184. Up to 16028 conditions per place. [2025-02-08 00:58:50,774 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 98 selfloop transitions, 2 changer transitions 62/167 dead transitions. [2025-02-08 00:58:50,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 167 transitions, 1171 flow [2025-02-08 00:58:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:58:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 00:58:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2025-02-08 00:58:50,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 00:58:50,775 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 294 flow. Second operand 6 states and 180 transitions. [2025-02-08 00:58:50,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 167 transitions, 1171 flow [2025-02-08 00:58:50,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 167 transitions, 1055 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-02-08 00:58:50,942 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 268 flow [2025-02-08 00:58:50,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2025-02-08 00:58:50,942 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2025-02-08 00:58:50,942 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 268 flow [2025-02-08 00:58:50,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02-08 00:58:50,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:58:50,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:58:50,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:58:50,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-08 00:58:50,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:58:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1132913057, now seen corresponding path program 2 times [2025-02-08 00:58:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:58:50,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218381593] [2025-02-08 00:58:50,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:58:50,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:58:50,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-08 00:58:50,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 00:58:50,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 00:58:50,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:58:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:58:51,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:58:51,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218381593] [2025-02-08 00:58:51,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218381593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:58:51,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:58:51,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:58:51,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039711257] [2025-02-08 00:58:51,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:58:51,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:58:51,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:58:51,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:58:51,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:58:51,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-08 00:58:51,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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-02-08 00:58:51,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:58:51,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-08 00:58:51,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand