./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix013.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix013.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 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:05:27,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:05:27,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:05:27,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:05:27,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:05:27,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:05:27,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:05:27,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:05:27,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:05:27,507 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:05:27,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:05:27,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:05:27,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:05:27,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:05:27,508 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:05:27,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:05:27,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:05:27,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:05:27,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:05:27,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:05:27,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:05:27,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:05:27,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:05:27,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:05:27,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:05:27,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:05:27,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:05:27,509 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:05:27,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:05:27,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:05:27,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:05:27,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:05:27,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:05:27,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:05:27,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:05:27,510 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:05:27,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:05:27,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:05:27,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:05:27,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:05:27,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:05:27,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:05:27,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:05:27,511 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 -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 [2025-03-04 02:05:27,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:05:27,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:05:27,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:05:27,748 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:05:27,748 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:05:27,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix013.opt.i [2025-03-04 02:05:28,870 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70de79c49/afc366adfe3f43438d06a856c0299485/FLAGb5c687134 [2025-03-04 02:05:29,143 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:05:29,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix013.opt.i [2025-03-04 02:05:29,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70de79c49/afc366adfe3f43438d06a856c0299485/FLAGb5c687134 [2025-03-04 02:05:29,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70de79c49/afc366adfe3f43438d06a856c0299485 [2025-03-04 02:05:29,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:05:29,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:05:29,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:05:29,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:05:29,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:05:29,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37192fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29, skipping insertion in model container [2025-03-04 02:05:29,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:05:29,319 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/mix013.opt.i[944,957] [2025-03-04 02:05:29,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:05:29,500 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:05:29,509 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/mix013.opt.i[944,957] [2025-03-04 02:05:29,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:05:29,585 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:05:29,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29 WrapperNode [2025-03-04 02:05:29,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:05:29,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:05:29,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:05:29,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:05:29,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,622 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2025-03-04 02:05:29,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:05:29,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:05:29,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:05:29,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:05:29,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,647 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:05:29,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:05:29,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:05:29,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:05:29,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:05:29,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (1/1) ... [2025-03-04 02:05:29,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:05:29,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:05:29,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:05:29,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:05:29,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:05:29,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:05:29,713 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 02:05:29,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 02:05:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 02:05:29,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 02:05:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 02:05:29,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 02:05:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-04 02:05:29,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-04 02:05:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:05:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:05:29,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:05:29,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:05:29,716 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:05:29,824 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:05:29,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:05:30,109 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:05:30,109 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:05:30,292 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:05:30,292 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:05:30,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:05:30 BoogieIcfgContainer [2025-03-04 02:05:30,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:05:30,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:05:30,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:05:30,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:05:30,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:05:29" (1/3) ... [2025-03-04 02:05:30,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71536431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:05:30, skipping insertion in model container [2025-03-04 02:05:30,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:05:29" (2/3) ... [2025-03-04 02:05:30,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71536431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:05:30, skipping insertion in model container [2025-03-04 02:05:30,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:05:30" (3/3) ... [2025-03-04 02:05:30,301 INFO L128 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2025-03-04 02:05:30,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:05:30,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix013.opt.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 02:05:30,314 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:05:30,363 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:05:30,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2025-03-04 02:05:30,420 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-04 02:05:30,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:05:30,426 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-03-04 02:05:30,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2025-03-04 02:05:30,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2025-03-04 02:05:30,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:05:30,447 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;@192aa660, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:05:30,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 02:05:30,455 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:05:30,455 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-04 02:05:30,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:05:30,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:05:30,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:05:30,456 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-03-04 02:05:30,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:05:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1487769060, now seen corresponding path program 1 times [2025-03-04 02:05:30,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:05:30,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212429908] [2025-03-04 02:05:30,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:05:30,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:05:30,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:05:30,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:05:30,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:05:30,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:05:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:05:30,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:05:30,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212429908] [2025-03-04 02:05:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212429908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:05:30,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:05:30,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 02:05:30,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940877164] [2025-03-04 02:05:30,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:05:30,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:05:30,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:05:30,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:05:30,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:05:30,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:05:30,905 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-03-04 02:05:30,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:05:30,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:05:30,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:05:34,773 INFO L124 PetriNetUnfolderBase]: 47373/62881 cut-off events. [2025-03-04 02:05:34,774 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2025-03-04 02:05:34,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125575 conditions, 62881 events. 47373/62881 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 1805. Compared 362916 event pairs, 6261 based on Foata normal form. 1764/64327 useless extension candidates. Maximal degree in co-relation 125563. Up to 53209 conditions per place. [2025-03-04 02:05:35,128 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 56 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2025-03-04 02:05:35,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 266 flow [2025-03-04 02:05:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:05:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:05:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-04 02:05:35,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-04 02:05:35,142 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 96 transitions. [2025-03-04 02:05:35,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 266 flow [2025-03-04 02:05:35,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 262 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:05:35,155 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2025-03-04 02:05:35,158 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-03-04 02:05:35,161 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-03-04 02:05:35,162 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2025-03-04 02:05:35,162 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-03-04 02:05:35,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:05:35,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:05:35,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:05:35,162 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-03-04 02:05:35,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:05:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1074235364, now seen corresponding path program 1 times [2025-03-04 02:05:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:05:35,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938150581] [2025-03-04 02:05:35,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:05:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:05:35,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:05:35,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:05:35,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:05:35,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:05:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:05:35,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:05:35,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938150581] [2025-03-04 02:05:35,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938150581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:05:35,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:05:35,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:05:35,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746607048] [2025-03-04 02:05:35,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:05:35,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:05:35,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:05:35,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:05:35,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:05:35,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-04 02:05:35,500 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-03-04 02:05:35,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:05:35,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-04 02:05:35,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:05:40,516 INFO L124 PetriNetUnfolderBase]: 69225/92693 cut-off events. [2025-03-04 02:05:40,516 INFO L125 PetriNetUnfolderBase]: For 2992/2992 co-relation queries the response was YES. [2025-03-04 02:05:40,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187221 conditions, 92693 events. 69225/92693 cut-off events. For 2992/2992 co-relation queries the response was YES. Maximal size of possible extension queue 2664. Compared 571127 event pairs, 35971 based on Foata normal form. 0/90929 useless extension candidates. Maximal degree in co-relation 187211. Up to 61559 conditions per place. [2025-03-04 02:05:40,934 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 50 selfloop transitions, 5 changer transitions 88/148 dead transitions. [2025-03-04 02:05:40,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 148 transitions, 612 flow [2025-03-04 02:05:40,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:05:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:05:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2025-03-04 02:05:40,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5425 [2025-03-04 02:05:40,936 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 8 states and 217 transitions. [2025-03-04 02:05:40,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 148 transitions, 612 flow [2025-03-04 02:05:40,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 148 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:05:40,950 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 149 flow [2025-03-04 02:05:40,951 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-03-04 02:05:40,951 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2025-03-04 02:05:40,951 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 149 flow [2025-03-04 02:05:40,951 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-04 02:05:40,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:05:40,952 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-03-04 02:05:40,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:05:40,952 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-03-04 02:05:40,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:05:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1147301750, now seen corresponding path program 1 times [2025-03-04 02:05:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:05:40,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370132274] [2025-03-04 02:05:40,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:05:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:05:40,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:05:40,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:05:40,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:05:40,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:05:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:05:41,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:05:41,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370132274] [2025-03-04 02:05:41,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370132274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:05:41,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:05:41,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:05:41,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611889182] [2025-03-04 02:05:41,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:05:41,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:05:41,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:05:41,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:05:41,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:05:41,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-04 02:05:41,152 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-03-04 02:05:41,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:05:41,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-04 02:05:41,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:05:45,425 INFO L124 PetriNetUnfolderBase]: 52321/70167 cut-off events. [2025-03-04 02:05:45,425 INFO L125 PetriNetUnfolderBase]: For 53537/53537 co-relation queries the response was YES. [2025-03-04 02:05:45,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178310 conditions, 70167 events. 52321/70167 cut-off events. For 53537/53537 co-relation queries the response was YES. Maximal size of possible extension queue 1958. Compared 425532 event pairs, 14323 based on Foata normal form. 1708/71842 useless extension candidates. Maximal degree in co-relation 178295. Up to 45075 conditions per place. [2025-03-04 02:05:45,871 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 62 selfloop transitions, 3 changer transitions 79/149 dead transitions. [2025-03-04 02:05:45,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 149 transitions, 759 flow [2025-03-04 02:05:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:05:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:05:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2025-03-04 02:05:45,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2025-03-04 02:05:45,873 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 149 flow. Second operand 7 states and 205 transitions. [2025-03-04 02:05:45,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 149 transitions, 759 flow [2025-03-04 02:05:47,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 149 transitions, 746 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 02:05:47,270 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 159 flow [2025-03-04 02:05:47,271 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-03-04 02:05:47,271 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-03-04 02:05:47,271 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 159 flow [2025-03-04 02:05:47,272 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-03-04 02:05:47,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:05:47,272 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-03-04 02:05:47,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:05:47,272 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-03-04 02:05:47,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:05:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1210844028, now seen corresponding path program 1 times [2025-03-04 02:05:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:05:47,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447242867] [2025-03-04 02:05:47,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:05:47,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:05:47,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:05:47,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:05:47,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:05:47,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:05:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:05:47,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:05:47,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447242867] [2025-03-04 02:05:47,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447242867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:05:47,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:05:47,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:05:47,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676415815] [2025-03-04 02:05:47,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:05:47,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:05:47,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:05:47,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:05:47,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:05:47,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-04 02:05:47,412 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-03-04 02:05:47,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:05:47,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-04 02:05:47,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:05:51,134 INFO L124 PetriNetUnfolderBase]: 45777/61351 cut-off events. [2025-03-04 02:05:51,134 INFO L125 PetriNetUnfolderBase]: For 60121/60121 co-relation queries the response was YES. [2025-03-04 02:05:51,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159868 conditions, 61351 events. 45777/61351 cut-off events. For 60121/60121 co-relation queries the response was YES. Maximal size of possible extension queue 1562. Compared 354325 event pairs, 10139 based on Foata normal form. 1260/62570 useless extension candidates. Maximal degree in co-relation 159849. Up to 38761 conditions per place. [2025-03-04 02:05:51,506 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 58 selfloop transitions, 3 changer transitions 71/137 dead transitions. [2025-03-04 02:05:51,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 137 transitions, 702 flow [2025-03-04 02:05:51,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:05:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:05:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions. [2025-03-04 02:05:51,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5514285714285714 [2025-03-04 02:05:51,507 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 159 flow. Second operand 7 states and 193 transitions. [2025-03-04 02:05:51,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 137 transitions, 702 flow [2025-03-04 02:05:52,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 137 transitions, 678 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-04 02:05:52,687 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 164 flow [2025-03-04 02:05:52,688 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-03-04 02:05:52,689 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-03-04 02:05:52,689 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 164 flow [2025-03-04 02:05:52,690 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-03-04 02:05:52,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:05:52,690 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-04 02:05:52,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:05:52,690 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-03-04 02:05:52,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:05:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1270787641, now seen corresponding path program 1 times [2025-03-04 02:05:52,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:05:52,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021144129] [2025-03-04 02:05:52,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:05:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:05:52,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:05:52,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:05:52,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:05:52,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:05:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:05:52,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:05:52,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021144129] [2025-03-04 02:05:52,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021144129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:05:52,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:05:52,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:05:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550477503] [2025-03-04 02:05:52,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:05:52,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:05:52,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:05:52,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:05:52,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:05:52,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:05:52,887 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-03-04 02:05:52,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:05:52,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:05:52,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:05:55,629 INFO L124 PetriNetUnfolderBase]: 34237/47275 cut-off events. [2025-03-04 02:05:55,629 INFO L125 PetriNetUnfolderBase]: For 46477/46477 co-relation queries the response was YES. [2025-03-04 02:05:55,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123341 conditions, 47275 events. 34237/47275 cut-off events. For 46477/46477 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 289111 event pairs, 4877 based on Foata normal form. 1764/49006 useless extension candidates. Maximal degree in co-relation 123321. Up to 23653 conditions per place. [2025-03-04 02:05:55,952 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 81 selfloop transitions, 6 changer transitions 1/94 dead transitions. [2025-03-04 02:05:55,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 498 flow [2025-03-04 02:05:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:05:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:05:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-03-04 02:05:55,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-04 02:05:55,953 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 164 flow. Second operand 4 states and 130 transitions. [2025-03-04 02:05:55,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 498 flow [2025-03-04 02:05:56,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 480 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 02:05:56,170 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 192 flow [2025-03-04 02:05:56,170 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-03-04 02:05:56,171 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2025-03-04 02:05:56,171 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 192 flow [2025-03-04 02:05:56,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:05:56,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:05:56,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:05:56,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:05:56,171 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-03-04 02:05:56,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:05:56,172 INFO L85 PathProgramCache]: Analyzing trace with hash -246087668, now seen corresponding path program 1 times [2025-03-04 02:05:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:05:56,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593559164] [2025-03-04 02:05:56,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:05:56,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:05:56,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:05:56,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:05:56,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:05:56,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:05:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:05:56,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:05:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593559164] [2025-03-04 02:05:56,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593559164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:05:56,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:05:56,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:05:56,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126351049] [2025-03-04 02:05:56,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:05:56,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:05:56,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:05:56,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:05:56,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:05:56,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:05:56,338 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-03-04 02:05:56,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:05:56,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:05:56,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:05:58,629 INFO L124 PetriNetUnfolderBase]: 23313/32447 cut-off events. [2025-03-04 02:05:58,630 INFO L125 PetriNetUnfolderBase]: For 30945/30945 co-relation queries the response was YES. [2025-03-04 02:05:58,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90183 conditions, 32447 events. 23313/32447 cut-off events. For 30945/30945 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 189054 event pairs, 2855 based on Foata normal form. 1364/33778 useless extension candidates. Maximal degree in co-relation 90165. Up to 10777 conditions per place. [2025-03-04 02:05:58,791 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 10 changer transitions 1/121 dead transitions. [2025-03-04 02:05:58,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 121 transitions, 671 flow [2025-03-04 02:05:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:05:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:05:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-03-04 02:05:58,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672 [2025-03-04 02:05:58,793 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 192 flow. Second operand 5 states and 168 transitions. [2025-03-04 02:05:58,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 121 transitions, 671 flow [2025-03-04 02:05:58,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 121 transitions, 660 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 02:05:58,801 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 244 flow [2025-03-04 02:05:58,801 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-03-04 02:05:58,802 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-03-04 02:05:58,802 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 244 flow [2025-03-04 02:05:58,802 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-03-04 02:05:58,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:05:58,802 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-03-04 02:05:58,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:05:58,802 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-03-04 02:05:58,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:05:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2059807585, now seen corresponding path program 1 times [2025-03-04 02:05:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:05:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482431940] [2025-03-04 02:05:58,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:05:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:05:58,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:05:58,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:05:58,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:05:58,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:05:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:05:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:05:59,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482431940] [2025-03-04 02:05:59,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482431940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:05:59,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:05:59,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:05:59,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407251311] [2025-03-04 02:05:59,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:05:59,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:05:59,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:05:59,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:05:59,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:05:59,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:05:59,014 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-03-04 02:05:59,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:05:59,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:05:59,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:00,235 INFO L124 PetriNetUnfolderBase]: 15089/20883 cut-off events. [2025-03-04 02:06:00,236 INFO L125 PetriNetUnfolderBase]: For 28543/28543 co-relation queries the response was YES. [2025-03-04 02:06:00,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61753 conditions, 20883 events. 15089/20883 cut-off events. For 28543/28543 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 112365 event pairs, 2465 based on Foata normal form. 644/21494 useless extension candidates. Maximal degree in co-relation 61733. Up to 6412 conditions per place. [2025-03-04 02:06:00,370 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 125 selfloop transitions, 14 changer transitions 1/146 dead transitions. [2025-03-04 02:06:00,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 146 transitions, 860 flow [2025-03-04 02:06:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:06:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:06:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-03-04 02:06:00,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-03-04 02:06:00,371 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 244 flow. Second operand 6 states and 204 transitions. [2025-03-04 02:06:00,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 146 transitions, 860 flow [2025-03-04 02:06:00,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 146 transitions, 830 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 02:06:00,538 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 294 flow [2025-03-04 02:06:00,538 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-03-04 02:06:00,538 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-03-04 02:06:00,538 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 294 flow [2025-03-04 02:06:00,538 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-03-04 02:06:00,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:00,539 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-03-04 02:06:00,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:06:00,539 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-03-04 02:06:00,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1068513898, now seen corresponding path program 1 times [2025-03-04 02:06:00,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:00,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465207691] [2025-03-04 02:06:00,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:06:00,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:00,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 02:06:00,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:06:00,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:06:00,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:06:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:06:00,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:06:00,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465207691] [2025-03-04 02:06:00,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465207691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:06:00,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:06:00,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:06:00,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968949557] [2025-03-04 02:06:00,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:06:00,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:06:00,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:06:00,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:06:00,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:06:00,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-04 02:06:00,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 294 flow. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:06:00,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:06:00,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-04 02:06:00,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:02,950 INFO L124 PetriNetUnfolderBase]: 21901/30111 cut-off events. [2025-03-04 02:06:02,950 INFO L125 PetriNetUnfolderBase]: For 42873/42873 co-relation queries the response was YES. [2025-03-04 02:06:03,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91738 conditions, 30111 events. 21901/30111 cut-off events. For 42873/42873 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 164484 event pairs, 3053 based on Foata normal form. 112/30216 useless extension candidates. Maximal degree in co-relation 91717. Up to 16837 conditions per place. [2025-03-04 02:06:03,114 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 92 selfloop transitions, 13 changer transitions 106/216 dead transitions. [2025-03-04 02:06:03,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 216 transitions, 1422 flow [2025-03-04 02:06:03,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:06:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:06:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 281 transitions. [2025-03-04 02:06:03,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5109090909090909 [2025-03-04 02:06:03,116 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 294 flow. Second operand 11 states and 281 transitions. [2025-03-04 02:06:03,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 216 transitions, 1422 flow [2025-03-04 02:06:03,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 216 transitions, 1312 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-04 02:06:03,454 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 344 flow [2025-03-04 02:06:03,454 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=344, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2025-03-04 02:06:03,456 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places. [2025-03-04 02:06:03,456 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 344 flow [2025-03-04 02:06:03,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:06:03,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:03,456 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-03-04 02:06:03,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:06:03,456 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-03-04 02:06:03,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1711061850, now seen corresponding path program 2 times [2025-03-04 02:06:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:03,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280207503] [2025-03-04 02:06:03,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:06:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:03,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-03-04 02:06:03,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:06:03,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:06:03,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:06:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:06:03,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:06:03,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280207503] [2025-03-04 02:06:03,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280207503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:06:03,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:06:03,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:06:03,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593555807] [2025-03-04 02:06:03,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:06:03,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:06:03,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:06:03,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:06:03,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:06:03,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-04 02:06:03,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 344 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-03-04 02:06:03,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:06:03,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-04 02:06:03,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:05,346 INFO L124 PetriNetUnfolderBase]: 19885/27400 cut-off events. [2025-03-04 02:06:05,346 INFO L125 PetriNetUnfolderBase]: For 38722/38722 co-relation queries the response was YES. [2025-03-04 02:06:05,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82703 conditions, 27400 events. 19885/27400 cut-off events. For 38722/38722 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 148781 event pairs, 4617 based on Foata normal form. 112/27501 useless extension candidates. Maximal degree in co-relation 82678. Up to 15974 conditions per place. [2025-03-04 02:06:05,543 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 111 selfloop transitions, 2 changer transitions 62/180 dead transitions. [2025-03-04 02:06:05,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 180 transitions, 1257 flow [2025-03-04 02:06:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:06:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:06:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2025-03-04 02:06:05,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 02:06:05,545 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 344 flow. Second operand 6 states and 180 transitions. [2025-03-04 02:06:05,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 180 transitions, 1257 flow [2025-03-04 02:06:05,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 180 transitions, 1209 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-04 02:06:05,740 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 334 flow [2025-03-04 02:06:05,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2025-03-04 02:06:05,741 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-03-04 02:06:05,741 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 334 flow [2025-03-04 02:06:05,741 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-03-04 02:06:05,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:05,741 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-03-04 02:06:05,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:06:05,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:06:05,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:05,742 INFO L85 PathProgramCache]: Analyzing trace with hash -360507160, now seen corresponding path program 3 times [2025-03-04 02:06:05,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:05,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580923129] [2025-03-04 02:06:05,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:06:05,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:05,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 1 equivalence classes. [2025-03-04 02:06:05,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:06:05,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:06:05,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:06:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:06:05,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:06:05,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580923129] [2025-03-04 02:06:05,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580923129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:06:05,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:06:05,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:06:05,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304799764] [2025-03-04 02:06:05,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:06:05,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:06:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:06:05,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:06:05,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:06:05,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-04 02:06:05,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 334 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-03-04 02:06:05,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:06:05,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-04 02:06:05,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:06:08,319 INFO L124 PetriNetUnfolderBase]: 30689/42403 cut-off events. [2025-03-04 02:06:08,319 INFO L125 PetriNetUnfolderBase]: For 56607/56607 co-relation queries the response was YES. [2025-03-04 02:06:08,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126770 conditions, 42403 events. 30689/42403 cut-off events. For 56607/56607 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 246343 event pairs, 8593 based on Foata normal form. 192/42587 useless extension candidates. Maximal degree in co-relation 126745. Up to 25134 conditions per place. [2025-03-04 02:06:08,671 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 125 selfloop transitions, 15 changer transitions 60/205 dead transitions. [2025-03-04 02:06:08,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 205 transitions, 1339 flow [2025-03-04 02:06:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:06:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:06:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions. [2025-03-04 02:06:08,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54 [2025-03-04 02:06:08,672 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 334 flow. Second operand 9 states and 243 transitions. [2025-03-04 02:06:08,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 205 transitions, 1339 flow [2025-03-04 02:06:09,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 205 transitions, 1323 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 02:06:09,161 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 454 flow [2025-03-04 02:06:09,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=454, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2025-03-04 02:06:09,161 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2025-03-04 02:06:09,162 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 454 flow [2025-03-04 02:06:09,162 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-03-04 02:06:09,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:06:09,162 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-03-04 02:06:09,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:06:09,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:06:09,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:06:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash 830534366, now seen corresponding path program 4 times [2025-03-04 02:06:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:06:09,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063316329] [2025-03-04 02:06:09,163 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:06:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:06:09,171 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-04 02:06:09,183 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:06:09,183 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:06:09,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:06:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:06:09,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:06:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063316329] [2025-03-04 02:06:09,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063316329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:06:09,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:06:09,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:06:09,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547077937] [2025-03-04 02:06:09,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:06:09,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:06:09,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:06:09,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:06:09,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:06:09,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-04 02:06:09,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 454 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-03-04 02:06:09,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:06:09,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-04 02:06:09,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand