./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:25:28,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:25:29,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:25:29,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:25:29,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:25:29,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:25:29,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:25:29,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:25:29,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:25:29,047 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:25:29,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:25:29,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:25:29,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:25:29,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:25:29,047 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:25:29,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:25:29,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:25:29,047 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:25:29,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:25:29,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:25:29,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:25:29,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:25:29,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:25:29,048 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:25:29,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:25:29,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:25:29,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:25:29,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:25:29,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:25:29,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:25:29,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:25:29,050 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2025-02-06 04:25:29,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:25:29,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:25:29,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:25:29,281 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:25:29,281 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:25:29,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 04:25:30,425 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc48c7435/2771248b3d9e42a085accc7b04255b52/FLAG2976bc825 [2025-02-06 04:25:30,679 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:25:30,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 04:25:30,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc48c7435/2771248b3d9e42a085accc7b04255b52/FLAG2976bc825 [2025-02-06 04:25:30,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc48c7435/2771248b3d9e42a085accc7b04255b52 [2025-02-06 04:25:30,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:25:30,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:25:30,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:25:30,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:25:30,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:25:30,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:25:30" (1/1) ... [2025-02-06 04:25:30,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a06d7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:30, skipping insertion in model container [2025-02-06 04:25:30,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:25:30" (1/1) ... [2025-02-06 04:25:31,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:25:31,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-02-06 04:25:31,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:25:31,381 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:25:31,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-02-06 04:25:31,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:25:31,464 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:25:31,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31 WrapperNode [2025-02-06 04:25:31,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:25:31,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:25:31,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:25:31,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:25:31,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,499 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2025-02-06 04:25:31,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:25:31,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:25:31,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:25:31,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:25:31,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,527 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 04:25:31,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,541 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:25:31,556 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:25:31,556 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:25:31,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:25:31,557 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (1/1) ... [2025-02-06 04:25:31,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:25:31,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:25:31,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:25:31,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:25:31,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:25:31,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:25:31,606 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 04:25:31,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 04:25:31,606 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 04:25:31,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 04:25:31,607 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 04:25:31,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 04:25:31,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:25:31,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:25:31,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:25:31,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:25:31,608 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:25:31,708 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:25:31,709 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:25:32,013 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:25:32,013 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:25:32,194 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:25:32,195 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:25:32,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:25:32 BoogieIcfgContainer [2025-02-06 04:25:32,195 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:25:32,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:25:32,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:25:32,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:25:32,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:25:30" (1/3) ... [2025-02-06 04:25:32,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e98d6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:25:32, skipping insertion in model container [2025-02-06 04:25:32,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:25:31" (2/3) ... [2025-02-06 04:25:32,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e98d6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:25:32, skipping insertion in model container [2025-02-06 04:25:32,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:25:32" (3/3) ... [2025-02-06 04:25:32,201 INFO L128 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 04:25:32,210 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:25:32,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 40 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-06 04:25:32,211 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:25:32,258 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:25:32,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2025-02-06 04:25:32,305 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-02-06 04:25:32,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:25:32,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-02-06 04:25:32,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2025-02-06 04:25:32,315 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2025-02-06 04:25:32,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:25:32,334 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;@18f2831b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:25:32,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:25:32,340 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:25:32,341 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-06 04:25:32,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:25:32,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:32,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 04:25:32,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:32,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:32,348 INFO L85 PathProgramCache]: Analyzing trace with hash 199072352, now seen corresponding path program 1 times [2025-02-06 04:25:32,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:32,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397900071] [2025-02-06 04:25:32,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:32,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:32,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 04:25:32,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 04:25:32,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:32,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:32,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:32,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397900071] [2025-02-06 04:25:32,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397900071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:32,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:32,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 04:25:32,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851284123] [2025-02-06 04:25:32,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:32,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:25:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:32,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:25:32,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:25:32,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-06 04:25:32,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:32,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:32,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-06 04:25:32,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:33,722 INFO L124 PetriNetUnfolderBase]: 4991/7238 cut-off events. [2025-02-06 04:25:33,722 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-02-06 04:25:33,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14449 conditions, 7238 events. 4991/7238 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 40050 event pairs, 551 based on Foata normal form. 252/7446 useless extension candidates. Maximal degree in co-relation 14438. Up to 6191 conditions per place. [2025-02-06 04:25:33,782 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 45 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2025-02-06 04:25:33,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 220 flow [2025-02-06 04:25:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:25:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:25:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-06 04:25:33,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-02-06 04:25:33,796 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 79 transitions. [2025-02-06 04:25:33,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 220 flow [2025-02-06 04:25:33,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:25:33,805 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2025-02-06 04:25:33,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-02-06 04:25:33,810 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2025-02-06 04:25:33,811 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2025-02-06 04:25:33,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:33,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:33,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:33,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:25:33,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:33,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2041527978, now seen corresponding path program 1 times [2025-02-06 04:25:33,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:33,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434589827] [2025-02-06 04:25:33,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:33,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:33,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:25:33,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:25:33,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:33,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:34,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:34,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434589827] [2025-02-06 04:25:34,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434589827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:34,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:34,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:25:34,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255574342] [2025-02-06 04:25:34,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:34,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:25:34,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:34,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:25:34,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:25:34,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:34,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:34,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:34,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:34,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:35,880 INFO L124 PetriNetUnfolderBase]: 6873/10047 cut-off events. [2025-02-06 04:25:35,881 INFO L125 PetriNetUnfolderBase]: For 490/490 co-relation queries the response was YES. [2025-02-06 04:25:35,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20469 conditions, 10047 events. 6873/10047 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 55600 event pairs, 972 based on Foata normal form. 0/9831 useless extension candidates. Maximal degree in co-relation 20459. Up to 5865 conditions per place. [2025-02-06 04:25:35,913 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 42 selfloop transitions, 2 changer transitions 75/123 dead transitions. [2025-02-06 04:25:35,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 123 transitions, 506 flow [2025-02-06 04:25:35,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:25:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:25:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2025-02-06 04:25:35,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553125 [2025-02-06 04:25:35,915 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 177 transitions. [2025-02-06 04:25:35,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 123 transitions, 506 flow [2025-02-06 04:25:35,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 123 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:25:35,918 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 88 flow [2025-02-06 04:25:35,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=88, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2025-02-06 04:25:35,919 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2025-02-06 04:25:35,919 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 88 flow [2025-02-06 04:25:35,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:35,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:35,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:35,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:25:35,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:35,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash -700777263, now seen corresponding path program 1 times [2025-02-06 04:25:35,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:35,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741216497] [2025-02-06 04:25:35,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:35,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:25:35,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:25:35,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:35,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:36,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:36,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741216497] [2025-02-06 04:25:36,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741216497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:36,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:36,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:25:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624158072] [2025-02-06 04:25:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:36,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:25:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:36,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:25:36,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:25:36,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:36,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:36,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:36,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:36,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:37,642 INFO L124 PetriNetUnfolderBase]: 5853/8472 cut-off events. [2025-02-06 04:25:37,642 INFO L125 PetriNetUnfolderBase]: For 2641/2641 co-relation queries the response was YES. [2025-02-06 04:25:37,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18927 conditions, 8472 events. 5853/8472 cut-off events. For 2641/2641 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 46931 event pairs, 752 based on Foata normal form. 229/8700 useless extension candidates. Maximal degree in co-relation 18912. Up to 4721 conditions per place. [2025-02-06 04:25:37,676 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 63 selfloop transitions, 16 changer transitions 90/173 dead transitions. [2025-02-06 04:25:37,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 173 transitions, 748 flow [2025-02-06 04:25:37,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:25:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 04:25:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 264 transitions. [2025-02-06 04:25:37,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2025-02-06 04:25:37,679 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 88 flow. Second operand 13 states and 264 transitions. [2025-02-06 04:25:37,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 173 transitions, 748 flow [2025-02-06 04:25:37,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 173 transitions, 708 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-02-06 04:25:37,704 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 247 flow [2025-02-06 04:25:37,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=247, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2025-02-06 04:25:37,705 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2025-02-06 04:25:37,705 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 247 flow [2025-02-06 04:25:37,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:37,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:37,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:37,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:25:37,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:37,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1055418249, now seen corresponding path program 2 times [2025-02-06 04:25:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:37,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772266343] [2025-02-06 04:25:37,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:25:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:37,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:25:37,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:25:37,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:25:37,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:37,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772266343] [2025-02-06 04:25:37,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772266343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:37,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:37,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:25:37,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077725407] [2025-02-06 04:25:37,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:37,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:25:37,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:37,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:25:37,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:25:37,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:37,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:37,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:37,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:37,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:38,731 INFO L124 PetriNetUnfolderBase]: 5122/7486 cut-off events. [2025-02-06 04:25:38,732 INFO L125 PetriNetUnfolderBase]: For 20595/20601 co-relation queries the response was YES. [2025-02-06 04:25:38,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28924 conditions, 7486 events. 5122/7486 cut-off events. For 20595/20601 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 40148 event pairs, 1258 based on Foata normal form. 210/7695 useless extension candidates. Maximal degree in co-relation 28902. Up to 4095 conditions per place. [2025-02-06 04:25:38,766 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 65 selfloop transitions, 4 changer transitions 51/124 dead transitions. [2025-02-06 04:25:38,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 124 transitions, 911 flow [2025-02-06 04:25:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:25:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:25:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2025-02-06 04:25:38,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2025-02-06 04:25:38,768 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 247 flow. Second operand 7 states and 149 transitions. [2025-02-06 04:25:38,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 124 transitions, 911 flow [2025-02-06 04:25:38,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 124 transitions, 879 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-06 04:25:38,817 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 253 flow [2025-02-06 04:25:38,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2025-02-06 04:25:38,818 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2025-02-06 04:25:38,818 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 253 flow [2025-02-06 04:25:38,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:38,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:38,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:38,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:25:38,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:38,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:38,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1430573459, now seen corresponding path program 1 times [2025-02-06 04:25:38,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:38,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869316191] [2025-02-06 04:25:38,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:38,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:38,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:25:38,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:25:38,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:38,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:39,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:39,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869316191] [2025-02-06 04:25:39,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869316191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:39,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:39,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:25:39,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526064217] [2025-02-06 04:25:39,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:39,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:25:39,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:39,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:25:39,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:25:39,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:39,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:39,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:39,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:39,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:39,956 INFO L124 PetriNetUnfolderBase]: 6007/8731 cut-off events. [2025-02-06 04:25:39,956 INFO L125 PetriNetUnfolderBase]: For 32253/32259 co-relation queries the response was YES. [2025-02-06 04:25:39,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32853 conditions, 8731 events. 6007/8731 cut-off events. For 32253/32259 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 46767 event pairs, 884 based on Foata normal form. 124/8853 useless extension candidates. Maximal degree in co-relation 32829. Up to 3178 conditions per place. [2025-02-06 04:25:39,993 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 54 selfloop transitions, 3 changer transitions 62/123 dead transitions. [2025-02-06 04:25:39,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 123 transitions, 920 flow [2025-02-06 04:25:39,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:25:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:25:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2025-02-06 04:25:39,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.509375 [2025-02-06 04:25:39,995 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 253 flow. Second operand 8 states and 163 transitions. [2025-02-06 04:25:39,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 123 transitions, 920 flow [2025-02-06 04:25:40,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 123 transitions, 892 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 04:25:40,031 INFO L231 Difference]: Finished difference. Result has 65 places, 36 transitions, 202 flow [2025-02-06 04:25:40,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=65, PETRI_TRANSITIONS=36} [2025-02-06 04:25:40,032 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 19 predicate places. [2025-02-06 04:25:40,033 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 36 transitions, 202 flow [2025-02-06 04:25:40,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:40,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:40,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:40,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:25:40,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:40,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:40,034 INFO L85 PathProgramCache]: Analyzing trace with hash 844945410, now seen corresponding path program 1 times [2025-02-06 04:25:40,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:40,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803629385] [2025-02-06 04:25:40,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:40,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:40,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:25:40,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:25:40,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:40,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803629385] [2025-02-06 04:25:40,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803629385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:40,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:40,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:25:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915890783] [2025-02-06 04:25:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:40,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:25:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:40,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:25:40,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:25:40,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-06 04:25:40,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 36 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:40,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:40,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-06 04:25:40,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:40,639 INFO L124 PetriNetUnfolderBase]: 2373/3694 cut-off events. [2025-02-06 04:25:40,639 INFO L125 PetriNetUnfolderBase]: For 14069/14071 co-relation queries the response was YES. [2025-02-06 04:25:40,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14040 conditions, 3694 events. 2373/3694 cut-off events. For 14069/14071 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 18561 event pairs, 394 based on Foata normal form. 182/3875 useless extension candidates. Maximal degree in co-relation 14014. Up to 1757 conditions per place. [2025-02-06 04:25:40,659 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 59 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2025-02-06 04:25:40,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 546 flow [2025-02-06 04:25:40,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:25:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:25:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-02-06 04:25:40,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63125 [2025-02-06 04:25:40,660 INFO L175 Difference]: Start difference. First operand has 65 places, 36 transitions, 202 flow. Second operand 4 states and 101 transitions. [2025-02-06 04:25:40,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 546 flow [2025-02-06 04:25:40,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 500 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-02-06 04:25:40,670 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 202 flow [2025-02-06 04:25:40,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2025-02-06 04:25:40,672 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2025-02-06 04:25:40,672 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 202 flow [2025-02-06 04:25:40,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:40,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:40,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:40,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:25:40,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:40,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash -509628695, now seen corresponding path program 1 times [2025-02-06 04:25:40,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:40,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417925668] [2025-02-06 04:25:40,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:40,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:25:40,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:25:40,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:40,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:40,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:40,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417925668] [2025-02-06 04:25:40,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417925668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:40,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:40,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:25:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854386886] [2025-02-06 04:25:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:40,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:25:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:40,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:25:40,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:25:40,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-06 04:25:40,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:40,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:40,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-06 04:25:40,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:41,211 INFO L124 PetriNetUnfolderBase]: 1537/2440 cut-off events. [2025-02-06 04:25:41,212 INFO L125 PetriNetUnfolderBase]: For 8522/8524 co-relation queries the response was YES. [2025-02-06 04:25:41,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9149 conditions, 2440 events. 1537/2440 cut-off events. For 8522/8524 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 11175 event pairs, 249 based on Foata normal form. 132/2571 useless extension candidates. Maximal degree in co-relation 9128. Up to 804 conditions per place. [2025-02-06 04:25:41,221 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 71 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2025-02-06 04:25:41,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 655 flow [2025-02-06 04:25:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:25:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:25:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-02-06 04:25:41,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-02-06 04:25:41,223 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 202 flow. Second operand 5 states and 125 transitions. [2025-02-06 04:25:41,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 655 flow [2025-02-06 04:25:41,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 645 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 04:25:41,226 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 242 flow [2025-02-06 04:25:41,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2025-02-06 04:25:41,227 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2025-02-06 04:25:41,227 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 242 flow [2025-02-06 04:25:41,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:41,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:41,227 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] [2025-02-06 04:25:41,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:25:41,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:41,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:41,228 INFO L85 PathProgramCache]: Analyzing trace with hash -377308838, now seen corresponding path program 1 times [2025-02-06 04:25:41,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:41,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80514311] [2025-02-06 04:25:41,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:41,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:41,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:25:41,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:25:41,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:41,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:41,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:41,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80514311] [2025-02-06 04:25:41,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80514311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:41,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:41,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:25:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398248002] [2025-02-06 04:25:41,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:41,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:25:41,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:41,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:25:41,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:25:41,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-02-06 04:25:41,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:41,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:41,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-02-06 04:25:41,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:41,672 INFO L124 PetriNetUnfolderBase]: 997/1576 cut-off events. [2025-02-06 04:25:41,672 INFO L125 PetriNetUnfolderBase]: For 6448/6450 co-relation queries the response was YES. [2025-02-06 04:25:41,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6235 conditions, 1576 events. 997/1576 cut-off events. For 6448/6450 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6565 event pairs, 219 based on Foata normal form. 52/1627 useless extension candidates. Maximal degree in co-relation 6212. Up to 572 conditions per place. [2025-02-06 04:25:41,677 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 61 selfloop transitions, 11 changer transitions 1/78 dead transitions. [2025-02-06 04:25:41,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 593 flow [2025-02-06 04:25:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:25:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:25:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-02-06 04:25:41,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2025-02-06 04:25:41,678 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 242 flow. Second operand 6 states and 127 transitions. [2025-02-06 04:25:41,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 593 flow [2025-02-06 04:25:41,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 540 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-02-06 04:25:41,684 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 232 flow [2025-02-06 04:25:41,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2025-02-06 04:25:41,686 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2025-02-06 04:25:41,686 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 232 flow [2025-02-06 04:25:41,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:41,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:41,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:41,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:25:41,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:41,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash 746411084, now seen corresponding path program 1 times [2025-02-06 04:25:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:41,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540966626] [2025-02-06 04:25:41,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:41,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:25:41,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:41,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:41,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:42,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:42,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540966626] [2025-02-06 04:25:42,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540966626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:42,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:42,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:25:42,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179537960] [2025-02-06 04:25:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:42,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:25:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:42,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:25:42,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:25:42,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:42,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 232 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:42,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:42,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:42,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:43,260 INFO L124 PetriNetUnfolderBase]: 1375/2153 cut-off events. [2025-02-06 04:25:43,260 INFO L125 PetriNetUnfolderBase]: For 7518/7518 co-relation queries the response was YES. [2025-02-06 04:25:43,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8245 conditions, 2153 events. 1375/2153 cut-off events. For 7518/7518 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9393 event pairs, 124 based on Foata normal form. 8/2160 useless extension candidates. Maximal degree in co-relation 8223. Up to 1440 conditions per place. [2025-02-06 04:25:43,267 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 61 selfloop transitions, 11 changer transitions 17/93 dead transitions. [2025-02-06 04:25:43,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 682 flow [2025-02-06 04:25:43,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:25:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:25:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-02-06 04:25:43,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-02-06 04:25:43,271 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 232 flow. Second operand 9 states and 140 transitions. [2025-02-06 04:25:43,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 682 flow [2025-02-06 04:25:43,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 93 transitions, 477 flow, removed 66 selfloop flow, removed 12 redundant places. [2025-02-06 04:25:43,279 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 229 flow [2025-02-06 04:25:43,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=229, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2025-02-06 04:25:43,280 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2025-02-06 04:25:43,280 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 229 flow [2025-02-06 04:25:43,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:43,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:43,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:43,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:25:43,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:43,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:43,281 INFO L85 PathProgramCache]: Analyzing trace with hash -633133060, now seen corresponding path program 2 times [2025-02-06 04:25:43,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:43,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180467005] [2025-02-06 04:25:43,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:25:43,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:43,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:25:43,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:43,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:25:43,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:44,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:44,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180467005] [2025-02-06 04:25:44,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180467005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:44,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:44,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:25:44,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386321032] [2025-02-06 04:25:44,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:44,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:25:44,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:44,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:25:44,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:25:44,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:44,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 229 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:44,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:44,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:44,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:45,330 INFO L124 PetriNetUnfolderBase]: 1894/2958 cut-off events. [2025-02-06 04:25:45,330 INFO L125 PetriNetUnfolderBase]: For 3410/3410 co-relation queries the response was YES. [2025-02-06 04:25:45,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8970 conditions, 2958 events. 1894/2958 cut-off events. For 3410/3410 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14089 event pairs, 318 based on Foata normal form. 8/2965 useless extension candidates. Maximal degree in co-relation 8951. Up to 1562 conditions per place. [2025-02-06 04:25:45,341 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 93 selfloop transitions, 17 changer transitions 30/144 dead transitions. [2025-02-06 04:25:45,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 905 flow [2025-02-06 04:25:45,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:25:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:25:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-02-06 04:25:45,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2025-02-06 04:25:45,343 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 229 flow. Second operand 11 states and 193 transitions. [2025-02-06 04:25:45,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 905 flow [2025-02-06 04:25:45,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 144 transitions, 852 flow, removed 26 selfloop flow, removed 4 redundant places. [2025-02-06 04:25:45,348 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 359 flow [2025-02-06 04:25:45,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=359, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2025-02-06 04:25:45,349 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2025-02-06 04:25:45,349 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 359 flow [2025-02-06 04:25:45,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:45,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:45,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:45,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:25:45,350 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:45,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1670869722, now seen corresponding path program 3 times [2025-02-06 04:25:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332627077] [2025-02-06 04:25:45,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:25:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:45,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:25:45,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:45,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:25:45,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:46,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:46,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332627077] [2025-02-06 04:25:46,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332627077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:46,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:46,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:25:46,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561765446] [2025-02-06 04:25:46,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:46,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:25:46,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:46,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:25:46,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:25:46,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:46,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 359 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:46,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:46,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:46,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:46,634 INFO L124 PetriNetUnfolderBase]: 2377/3723 cut-off events. [2025-02-06 04:25:46,637 INFO L125 PetriNetUnfolderBase]: For 5630/5630 co-relation queries the response was YES. [2025-02-06 04:25:46,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11824 conditions, 3723 events. 2377/3723 cut-off events. For 5630/5630 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18616 event pairs, 446 based on Foata normal form. 8/3730 useless extension candidates. Maximal degree in co-relation 11801. Up to 2122 conditions per place. [2025-02-06 04:25:46,649 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 68 selfloop transitions, 13 changer transitions 63/148 dead transitions. [2025-02-06 04:25:46,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 148 transitions, 1056 flow [2025-02-06 04:25:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:25:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:25:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2025-02-06 04:25:46,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435 [2025-02-06 04:25:46,650 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 359 flow. Second operand 10 states and 174 transitions. [2025-02-06 04:25:46,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 148 transitions, 1056 flow [2025-02-06 04:25:46,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 148 transitions, 1009 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-02-06 04:25:46,660 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 441 flow [2025-02-06 04:25:46,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=441, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2025-02-06 04:25:46,661 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 32 predicate places. [2025-02-06 04:25:46,661 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 441 flow [2025-02-06 04:25:46,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:46,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:46,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:46,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:25:46,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:46,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:46,662 INFO L85 PathProgramCache]: Analyzing trace with hash -906047810, now seen corresponding path program 4 times [2025-02-06 04:25:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:46,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069788652] [2025-02-06 04:25:46,662 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:25:46,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:46,672 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:25:46,775 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:46,775 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:25:46,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:48,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:48,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069788652] [2025-02-06 04:25:48,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069788652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:48,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:48,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:25:48,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196039145] [2025-02-06 04:25:48,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:48,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:25:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:48,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:25:48,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:25:48,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-02-06 04:25:48,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 441 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:48,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:48,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-02-06 04:25:48,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:49,121 INFO L124 PetriNetUnfolderBase]: 3697/5783 cut-off events. [2025-02-06 04:25:49,121 INFO L125 PetriNetUnfolderBase]: For 10915/10915 co-relation queries the response was YES. [2025-02-06 04:25:49,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19562 conditions, 5783 events. 3697/5783 cut-off events. For 10915/10915 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 31987 event pairs, 413 based on Foata normal form. 8/5790 useless extension candidates. Maximal degree in co-relation 19535. Up to 1623 conditions per place. [2025-02-06 04:25:49,142 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 179 selfloop transitions, 45 changer transitions 47/275 dead transitions. [2025-02-06 04:25:49,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 275 transitions, 1990 flow [2025-02-06 04:25:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 04:25:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 04:25:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 326 transitions. [2025-02-06 04:25:49,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.509375 [2025-02-06 04:25:49,144 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 441 flow. Second operand 16 states and 326 transitions. [2025-02-06 04:25:49,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 275 transitions, 1990 flow [2025-02-06 04:25:49,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 275 transitions, 1938 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-02-06 04:25:49,157 INFO L231 Difference]: Finished difference. Result has 92 places, 92 transitions, 841 flow [2025-02-06 04:25:49,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=841, PETRI_PLACES=92, PETRI_TRANSITIONS=92} [2025-02-06 04:25:49,158 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2025-02-06 04:25:49,158 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 841 flow [2025-02-06 04:25:49,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:49,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:49,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:49,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:25:49,158 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:49,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:49,159 INFO L85 PathProgramCache]: Analyzing trace with hash -302834144, now seen corresponding path program 5 times [2025-02-06 04:25:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:49,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311660424] [2025-02-06 04:25:49,159 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:25:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:49,166 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:25:49,178 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:49,178 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:25:49,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:49,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:49,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311660424] [2025-02-06 04:25:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311660424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:49,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:49,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:25:49,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865287025] [2025-02-06 04:25:49,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:49,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:25:49,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:49,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:25:49,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:25:49,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:49,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 841 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:49,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:49,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:49,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:50,284 INFO L124 PetriNetUnfolderBase]: 3454/5434 cut-off events. [2025-02-06 04:25:50,284 INFO L125 PetriNetUnfolderBase]: For 17364/17365 co-relation queries the response was YES. [2025-02-06 04:25:50,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20630 conditions, 5434 events. 3454/5434 cut-off events. For 17364/17365 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 29824 event pairs, 1539 based on Foata normal form. 8/5441 useless extension candidates. Maximal degree in co-relation 20595. Up to 2678 conditions per place. [2025-02-06 04:25:50,310 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 84 selfloop transitions, 21 changer transitions 62/171 dead transitions. [2025-02-06 04:25:50,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 171 transitions, 1643 flow [2025-02-06 04:25:50,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:25:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:25:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2025-02-06 04:25:50,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2025-02-06 04:25:50,312 INFO L175 Difference]: Start difference. First operand has 92 places, 92 transitions, 841 flow. Second operand 9 states and 159 transitions. [2025-02-06 04:25:50,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 171 transitions, 1643 flow [2025-02-06 04:25:50,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 171 transitions, 1552 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-02-06 04:25:50,338 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 731 flow [2025-02-06 04:25:50,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=731, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2025-02-06 04:25:50,338 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 53 predicate places. [2025-02-06 04:25:50,338 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 731 flow [2025-02-06 04:25:50,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:50,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:50,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:50,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:25:50,339 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:50,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1977423420, now seen corresponding path program 6 times [2025-02-06 04:25:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:50,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189587611] [2025-02-06 04:25:50,339 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:25:50,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:50,346 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:25:50,378 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:50,378 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:25:50,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:50,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:50,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189587611] [2025-02-06 04:25:50,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189587611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:50,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:50,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:25:50,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946635007] [2025-02-06 04:25:50,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:50,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:25:50,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:50,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:25:50,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:25:50,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:50,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 731 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:50,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:50,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:50,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:51,602 INFO L124 PetriNetUnfolderBase]: 3044/4756 cut-off events. [2025-02-06 04:25:51,602 INFO L125 PetriNetUnfolderBase]: For 18278/18278 co-relation queries the response was YES. [2025-02-06 04:25:51,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19248 conditions, 4756 events. 3044/4756 cut-off events. For 18278/18278 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 25254 event pairs, 381 based on Foata normal form. 8/4763 useless extension candidates. Maximal degree in co-relation 19209. Up to 2292 conditions per place. [2025-02-06 04:25:51,626 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 102 selfloop transitions, 45 changer transitions 27/178 dead transitions. [2025-02-06 04:25:51,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 178 transitions, 1772 flow [2025-02-06 04:25:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:25:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:25:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2025-02-06 04:25:51,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-02-06 04:25:51,627 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 731 flow. Second operand 11 states and 190 transitions. [2025-02-06 04:25:51,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 178 transitions, 1772 flow [2025-02-06 04:25:51,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 178 transitions, 1663 flow, removed 34 selfloop flow, removed 11 redundant places. [2025-02-06 04:25:51,658 INFO L231 Difference]: Finished difference. Result has 98 places, 105 transitions, 1160 flow [2025-02-06 04:25:51,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1160, PETRI_PLACES=98, PETRI_TRANSITIONS=105} [2025-02-06 04:25:51,658 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 52 predicate places. [2025-02-06 04:25:51,658 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 105 transitions, 1160 flow [2025-02-06 04:25:51,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:51,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:51,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:51,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:25:51,659 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:51,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash 770888648, now seen corresponding path program 7 times [2025-02-06 04:25:51,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:51,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829964932] [2025-02-06 04:25:51,659 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:25:51,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:51,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:25:51,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:51,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:51,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:52,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829964932] [2025-02-06 04:25:52,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829964932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:52,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:52,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:25:52,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823999078] [2025-02-06 04:25:52,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:52,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:25:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:52,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:25:52,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:25:52,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:52,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 105 transitions, 1160 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:52,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:52,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:52,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:52,978 INFO L124 PetriNetUnfolderBase]: 2980/4674 cut-off events. [2025-02-06 04:25:52,978 INFO L125 PetriNetUnfolderBase]: For 19022/19022 co-relation queries the response was YES. [2025-02-06 04:25:52,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19443 conditions, 4674 events. 2980/4674 cut-off events. For 19022/19022 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 24871 event pairs, 505 based on Foata normal form. 8/4681 useless extension candidates. Maximal degree in co-relation 19405. Up to 2959 conditions per place. [2025-02-06 04:25:53,003 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 101 selfloop transitions, 49 changer transitions 33/187 dead transitions. [2025-02-06 04:25:53,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 187 transitions, 1994 flow [2025-02-06 04:25:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:25:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:25:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2025-02-06 04:25:53,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4225 [2025-02-06 04:25:53,005 INFO L175 Difference]: Start difference. First operand has 98 places, 105 transitions, 1160 flow. Second operand 10 states and 169 transitions. [2025-02-06 04:25:53,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 187 transitions, 1994 flow [2025-02-06 04:25:53,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 187 transitions, 1817 flow, removed 71 selfloop flow, removed 6 redundant places. [2025-02-06 04:25:53,047 INFO L231 Difference]: Finished difference. Result has 104 places, 115 transitions, 1310 flow [2025-02-06 04:25:53,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1310, PETRI_PLACES=104, PETRI_TRANSITIONS=115} [2025-02-06 04:25:53,048 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 58 predicate places. [2025-02-06 04:25:53,048 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 115 transitions, 1310 flow [2025-02-06 04:25:53,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:53,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:53,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:53,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:25:53,048 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:53,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:53,049 INFO L85 PathProgramCache]: Analyzing trace with hash 170808300, now seen corresponding path program 8 times [2025-02-06 04:25:53,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:53,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553171808] [2025-02-06 04:25:53,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:25:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:53,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:25:53,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:53,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:25:53,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:53,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:53,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553171808] [2025-02-06 04:25:53,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553171808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:53,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:53,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:25:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087486519] [2025-02-06 04:25:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:53,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:25:53,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:53,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:25:53,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:25:53,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:53,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 115 transitions, 1310 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:53,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:53,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:53,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:54,492 INFO L124 PetriNetUnfolderBase]: 3535/5589 cut-off events. [2025-02-06 04:25:54,492 INFO L125 PetriNetUnfolderBase]: For 22658/22658 co-relation queries the response was YES. [2025-02-06 04:25:54,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22877 conditions, 5589 events. 3535/5589 cut-off events. For 22658/22658 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 30911 event pairs, 755 based on Foata normal form. 8/5596 useless extension candidates. Maximal degree in co-relation 22837. Up to 2956 conditions per place. [2025-02-06 04:25:54,523 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 136 selfloop transitions, 30 changer transitions 37/207 dead transitions. [2025-02-06 04:25:54,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 207 transitions, 2158 flow [2025-02-06 04:25:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:25:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:25:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 211 transitions. [2025-02-06 04:25:54,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4395833333333333 [2025-02-06 04:25:54,525 INFO L175 Difference]: Start difference. First operand has 104 places, 115 transitions, 1310 flow. Second operand 12 states and 211 transitions. [2025-02-06 04:25:54,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 207 transitions, 2158 flow [2025-02-06 04:25:54,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 207 transitions, 2066 flow, removed 41 selfloop flow, removed 5 redundant places. [2025-02-06 04:25:54,587 INFO L231 Difference]: Finished difference. Result has 112 places, 106 transitions, 1172 flow [2025-02-06 04:25:54,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1172, PETRI_PLACES=112, PETRI_TRANSITIONS=106} [2025-02-06 04:25:54,587 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 66 predicate places. [2025-02-06 04:25:54,587 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 1172 flow [2025-02-06 04:25:54,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:54,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:54,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:54,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:25:54,588 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:54,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:54,588 INFO L85 PathProgramCache]: Analyzing trace with hash -358401040, now seen corresponding path program 9 times [2025-02-06 04:25:54,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:54,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523045917] [2025-02-06 04:25:54,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:25:54,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:54,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:25:54,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:54,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:25:54,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:55,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:55,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523045917] [2025-02-06 04:25:55,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523045917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:55,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:55,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:25:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23610236] [2025-02-06 04:25:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:55,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:25:55,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:55,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:25:55,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:25:55,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:55,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 1172 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:55,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:55,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:55,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:55,646 INFO L124 PetriNetUnfolderBase]: 3301/5247 cut-off events. [2025-02-06 04:25:55,647 INFO L125 PetriNetUnfolderBase]: For 19164/19164 co-relation queries the response was YES. [2025-02-06 04:25:55,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20608 conditions, 5247 events. 3301/5247 cut-off events. For 19164/19164 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 28840 event pairs, 787 based on Foata normal form. 8/5254 useless extension candidates. Maximal degree in co-relation 20567. Up to 2901 conditions per place. [2025-02-06 04:25:55,669 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 101 selfloop transitions, 18 changer transitions 39/162 dead transitions. [2025-02-06 04:25:55,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 162 transitions, 1700 flow [2025-02-06 04:25:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:25:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:25:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2025-02-06 04:25:55,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2025-02-06 04:25:55,670 INFO L175 Difference]: Start difference. First operand has 112 places, 106 transitions, 1172 flow. Second operand 9 states and 151 transitions. [2025-02-06 04:25:55,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 162 transitions, 1700 flow [2025-02-06 04:25:55,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 162 transitions, 1562 flow, removed 21 selfloop flow, removed 14 redundant places. [2025-02-06 04:25:55,701 INFO L231 Difference]: Finished difference. Result has 107 places, 97 transitions, 949 flow [2025-02-06 04:25:55,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=949, PETRI_PLACES=107, PETRI_TRANSITIONS=97} [2025-02-06 04:25:55,701 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 61 predicate places. [2025-02-06 04:25:55,701 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 97 transitions, 949 flow [2025-02-06 04:25:55,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:55,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:55,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:55,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:25:55,702 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:55,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash 919411110, now seen corresponding path program 10 times [2025-02-06 04:25:55,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:55,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319450379] [2025-02-06 04:25:55,702 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:25:55,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:55,708 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:25:55,771 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:55,772 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:25:55,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:57,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:57,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319450379] [2025-02-06 04:25:57,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319450379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:57,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:57,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:25:57,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907589017] [2025-02-06 04:25:57,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:57,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:25:57,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:57,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:25:57,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:25:57,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-02-06 04:25:57,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 97 transitions, 949 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:57,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:57,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-02-06 04:25:57,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:57,890 INFO L124 PetriNetUnfolderBase]: 3337/5294 cut-off events. [2025-02-06 04:25:57,890 INFO L125 PetriNetUnfolderBase]: For 17730/17730 co-relation queries the response was YES. [2025-02-06 04:25:57,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19798 conditions, 5294 events. 3337/5294 cut-off events. For 17730/17730 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 29346 event pairs, 1584 based on Foata normal form. 16/5310 useless extension candidates. Maximal degree in co-relation 19762. Up to 3201 conditions per place. [2025-02-06 04:25:57,918 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 83 selfloop transitions, 13 changer transitions 72/172 dead transitions. [2025-02-06 04:25:57,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 172 transitions, 1755 flow [2025-02-06 04:25:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:25:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:25:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2025-02-06 04:25:57,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2025-02-06 04:25:57,919 INFO L175 Difference]: Start difference. First operand has 107 places, 97 transitions, 949 flow. Second operand 9 states and 158 transitions. [2025-02-06 04:25:57,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 172 transitions, 1755 flow [2025-02-06 04:25:57,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 172 transitions, 1637 flow, removed 8 selfloop flow, removed 13 redundant places. [2025-02-06 04:25:57,949 INFO L231 Difference]: Finished difference. Result has 98 places, 81 transitions, 704 flow [2025-02-06 04:25:57,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=704, PETRI_PLACES=98, PETRI_TRANSITIONS=81} [2025-02-06 04:25:57,949 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 52 predicate places. [2025-02-06 04:25:57,951 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 81 transitions, 704 flow [2025-02-06 04:25:57,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:57,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:57,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:57,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 04:25:57,951 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:57,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash -724723256, now seen corresponding path program 11 times [2025-02-06 04:25:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:57,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171296222] [2025-02-06 04:25:57,952 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:25:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:57,958 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:25:57,975 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:57,975 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:25:57,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:58,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171296222] [2025-02-06 04:25:58,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171296222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:58,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:58,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:25:58,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683309648] [2025-02-06 04:25:58,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:58,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:25:58,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:58,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:25:58,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:25:58,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:25:58,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 81 transitions, 704 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:58,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:58,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:25:58,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:59,269 INFO L124 PetriNetUnfolderBase]: 2221/3513 cut-off events. [2025-02-06 04:25:59,269 INFO L125 PetriNetUnfolderBase]: For 9512/9512 co-relation queries the response was YES. [2025-02-06 04:25:59,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13047 conditions, 3513 events. 2221/3513 cut-off events. For 9512/9512 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17724 event pairs, 406 based on Foata normal form. 8/3521 useless extension candidates. Maximal degree in co-relation 13013. Up to 1647 conditions per place. [2025-02-06 04:25:59,284 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 105 selfloop transitions, 26 changer transitions 29/164 dead transitions. [2025-02-06 04:25:59,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 164 transitions, 1407 flow [2025-02-06 04:25:59,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:25:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:25:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2025-02-06 04:25:59,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4275 [2025-02-06 04:25:59,285 INFO L175 Difference]: Start difference. First operand has 98 places, 81 transitions, 704 flow. Second operand 10 states and 171 transitions. [2025-02-06 04:25:59,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 164 transitions, 1407 flow [2025-02-06 04:25:59,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 164 transitions, 1365 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-02-06 04:25:59,300 INFO L231 Difference]: Finished difference. Result has 102 places, 82 transitions, 779 flow [2025-02-06 04:25:59,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=779, PETRI_PLACES=102, PETRI_TRANSITIONS=82} [2025-02-06 04:25:59,300 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 56 predicate places. [2025-02-06 04:25:59,300 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 82 transitions, 779 flow [2025-02-06 04:25:59,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:59,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:59,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:59,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 04:25:59,301 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:59,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash -343332680, now seen corresponding path program 12 times [2025-02-06 04:25:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:59,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312209059] [2025-02-06 04:25:59,301 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:25:59,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:59,307 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:25:59,340 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:25:59,341 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:25:59,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:00,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:00,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312209059] [2025-02-06 04:26:00,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312209059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:00,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:26:00,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90604624] [2025-02-06 04:26:00,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:00,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:26:00,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:00,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:26:00,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:26:00,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:26:00,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 82 transitions, 779 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:00,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:00,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:26:00,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:01,148 INFO L124 PetriNetUnfolderBase]: 2244/3556 cut-off events. [2025-02-06 04:26:01,148 INFO L125 PetriNetUnfolderBase]: For 12402/12402 co-relation queries the response was YES. [2025-02-06 04:26:01,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13636 conditions, 3556 events. 2244/3556 cut-off events. For 12402/12402 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17817 event pairs, 422 based on Foata normal form. 8/3564 useless extension candidates. Maximal degree in co-relation 13601. Up to 2093 conditions per place. [2025-02-06 04:26:01,160 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 77 selfloop transitions, 43 changer transitions 30/154 dead transitions. [2025-02-06 04:26:01,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 154 transitions, 1446 flow [2025-02-06 04:26:01,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:26:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:26:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2025-02-06 04:26:01,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2025-02-06 04:26:01,161 INFO L175 Difference]: Start difference. First operand has 102 places, 82 transitions, 779 flow. Second operand 9 states and 151 transitions. [2025-02-06 04:26:01,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 154 transitions, 1446 flow [2025-02-06 04:26:01,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 154 transitions, 1341 flow, removed 42 selfloop flow, removed 8 redundant places. [2025-02-06 04:26:01,177 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 915 flow [2025-02-06 04:26:01,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=915, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2025-02-06 04:26:01,178 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 54 predicate places. [2025-02-06 04:26:01,178 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 915 flow [2025-02-06 04:26:01,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:01,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:01,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:01,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 04:26:01,178 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:26:01,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:01,179 INFO L85 PathProgramCache]: Analyzing trace with hash -922569636, now seen corresponding path program 13 times [2025-02-06 04:26:01,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:01,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462158536] [2025-02-06 04:26:01,179 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:26:01,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:01,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:26:01,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:26:01,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:01,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:01,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:01,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462158536] [2025-02-06 04:26:01,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462158536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:01,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:01,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:26:01,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490770304] [2025-02-06 04:26:01,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:01,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:26:01,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:01,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:26:01,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:26:01,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:26:01,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 915 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:01,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:01,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:26:01,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:02,269 INFO L124 PetriNetUnfolderBase]: 2436/3881 cut-off events. [2025-02-06 04:26:02,269 INFO L125 PetriNetUnfolderBase]: For 14488/14489 co-relation queries the response was YES. [2025-02-06 04:26:02,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14760 conditions, 3881 events. 2436/3881 cut-off events. For 14488/14489 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 20284 event pairs, 355 based on Foata normal form. 8/3889 useless extension candidates. Maximal degree in co-relation 14726. Up to 1095 conditions per place. [2025-02-06 04:26:02,284 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 117 selfloop transitions, 29 changer transitions 25/175 dead transitions. [2025-02-06 04:26:02,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 175 transitions, 1651 flow [2025-02-06 04:26:02,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:26:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:26:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2025-02-06 04:26:02,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4275 [2025-02-06 04:26:02,285 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 915 flow. Second operand 10 states and 171 transitions. [2025-02-06 04:26:02,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 175 transitions, 1651 flow [2025-02-06 04:26:02,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 175 transitions, 1526 flow, removed 50 selfloop flow, removed 7 redundant places. [2025-02-06 04:26:02,310 INFO L231 Difference]: Finished difference. Result has 102 places, 90 transitions, 891 flow [2025-02-06 04:26:02,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=891, PETRI_PLACES=102, PETRI_TRANSITIONS=90} [2025-02-06 04:26:02,311 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 56 predicate places. [2025-02-06 04:26:02,311 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 90 transitions, 891 flow [2025-02-06 04:26:02,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:02,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:02,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:02,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 04:26:02,312 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:26:02,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1961048924, now seen corresponding path program 14 times [2025-02-06 04:26:02,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:02,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020451495] [2025-02-06 04:26:02,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:26:02,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:02,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:26:02,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:26:02,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:26:02,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:02,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:02,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020451495] [2025-02-06 04:26:02,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020451495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:02,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:02,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:26:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992194367] [2025-02-06 04:26:02,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:02,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:26:02,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:02,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:26:02,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:26:02,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:26:02,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 90 transitions, 891 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:02,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:02,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:26:02,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:03,388 INFO L124 PetriNetUnfolderBase]: 2297/3663 cut-off events. [2025-02-06 04:26:03,388 INFO L125 PetriNetUnfolderBase]: For 14612/14612 co-relation queries the response was YES. [2025-02-06 04:26:03,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13508 conditions, 3663 events. 2297/3663 cut-off events. For 14612/14612 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18752 event pairs, 622 based on Foata normal form. 8/3671 useless extension candidates. Maximal degree in co-relation 13475. Up to 2760 conditions per place. [2025-02-06 04:26:03,404 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 83 selfloop transitions, 10 changer transitions 44/141 dead transitions. [2025-02-06 04:26:03,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 141 transitions, 1393 flow [2025-02-06 04:26:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:26:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:26:03,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2025-02-06 04:26:03,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.365 [2025-02-06 04:26:03,405 INFO L175 Difference]: Start difference. First operand has 102 places, 90 transitions, 891 flow. Second operand 10 states and 146 transitions. [2025-02-06 04:26:03,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 141 transitions, 1393 flow [2025-02-06 04:26:03,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 141 transitions, 1323 flow, removed 19 selfloop flow, removed 8 redundant places. [2025-02-06 04:26:03,429 INFO L231 Difference]: Finished difference. Result has 104 places, 83 transitions, 765 flow [2025-02-06 04:26:03,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=765, PETRI_PLACES=104, PETRI_TRANSITIONS=83} [2025-02-06 04:26:03,429 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 58 predicate places. [2025-02-06 04:26:03,429 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 83 transitions, 765 flow [2025-02-06 04:26:03,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:03,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:03,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:03,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 04:26:03,430 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:26:03,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:03,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2031418604, now seen corresponding path program 15 times [2025-02-06 04:26:03,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:03,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197905159] [2025-02-06 04:26:03,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:26:03,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:03,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:26:03,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:26:03,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:26:03,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:04,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:04,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197905159] [2025-02-06 04:26:04,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197905159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:04,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:04,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:26:04,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447940439] [2025-02-06 04:26:04,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:04,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:26:04,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:04,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:26:04,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:26:04,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-02-06 04:26:04,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 83 transitions, 765 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:04,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:04,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-02-06 04:26:04,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:05,208 INFO L124 PetriNetUnfolderBase]: 2070/3320 cut-off events. [2025-02-06 04:26:05,208 INFO L125 PetriNetUnfolderBase]: For 9774/9774 co-relation queries the response was YES. [2025-02-06 04:26:05,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11289 conditions, 3320 events. 2070/3320 cut-off events. For 9774/9774 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17097 event pairs, 528 based on Foata normal form. 8/3328 useless extension candidates. Maximal degree in co-relation 11259. Up to 2041 conditions per place. [2025-02-06 04:26:05,218 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 61 selfloop transitions, 21 changer transitions 29/115 dead transitions. [2025-02-06 04:26:05,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 115 transitions, 1104 flow [2025-02-06 04:26:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:26:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:26:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2025-02-06 04:26:05,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36875 [2025-02-06 04:26:05,219 INFO L175 Difference]: Start difference. First operand has 104 places, 83 transitions, 765 flow. Second operand 8 states and 118 transitions. [2025-02-06 04:26:05,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 115 transitions, 1104 flow [2025-02-06 04:26:05,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 115 transitions, 1017 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-02-06 04:26:05,228 INFO L231 Difference]: Finished difference. Result has 92 places, 70 transitions, 611 flow [2025-02-06 04:26:05,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=611, PETRI_PLACES=92, PETRI_TRANSITIONS=70} [2025-02-06 04:26:05,229 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2025-02-06 04:26:05,229 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 70 transitions, 611 flow [2025-02-06 04:26:05,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:05,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:05,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:05,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 04:26:05,229 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:26:05,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:05,230 INFO L85 PathProgramCache]: Analyzing trace with hash 64733940, now seen corresponding path program 16 times [2025-02-06 04:26:05,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:05,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528511371] [2025-02-06 04:26:05,230 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:26:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:05,236 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 04:26:05,287 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:26:05,288 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:26:05,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:07,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:07,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528511371] [2025-02-06 04:26:07,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528511371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:07,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:07,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:26:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194436868] [2025-02-06 04:26:07,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:07,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 04:26:07,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:07,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 04:26:07,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:26:07,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-02-06 04:26:07,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 70 transitions, 611 flow. Second operand has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 14 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:07,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:07,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-02-06 04:26:07,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:08,484 INFO L124 PetriNetUnfolderBase]: 1474/2412 cut-off events. [2025-02-06 04:26:08,484 INFO L125 PetriNetUnfolderBase]: For 6049/6049 co-relation queries the response was YES. [2025-02-06 04:26:08,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8077 conditions, 2412 events. 1474/2412 cut-off events. For 6049/6049 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11736 event pairs, 519 based on Foata normal form. 16/2428 useless extension candidates. Maximal degree in co-relation 8051. Up to 1117 conditions per place. [2025-02-06 04:26:08,493 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 56 selfloop transitions, 7 changer transitions 65/132 dead transitions. [2025-02-06 04:26:08,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 132 transitions, 1087 flow [2025-02-06 04:26:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:26:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:26:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2025-02-06 04:26:08,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-02-06 04:26:08,494 INFO L175 Difference]: Start difference. First operand has 92 places, 70 transitions, 611 flow. Second operand 11 states and 176 transitions. [2025-02-06 04:26:08,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 132 transitions, 1087 flow [2025-02-06 04:26:08,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 132 transitions, 1033 flow, removed 11 selfloop flow, removed 12 redundant places. [2025-02-06 04:26:08,501 INFO L231 Difference]: Finished difference. Result has 94 places, 57 transitions, 436 flow [2025-02-06 04:26:08,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=436, PETRI_PLACES=94, PETRI_TRANSITIONS=57} [2025-02-06 04:26:08,502 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 48 predicate places. [2025-02-06 04:26:08,502 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 57 transitions, 436 flow [2025-02-06 04:26:08,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 14 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:08,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:08,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:08,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 04:26:08,503 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:26:08,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:08,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1417907144, now seen corresponding path program 17 times [2025-02-06 04:26:08,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:08,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618119012] [2025-02-06 04:26:08,503 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:26:08,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:08,509 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:26:08,580 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:26:08,580 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:26:08,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:26:08,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:26:08,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 04:26:08,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 04:26:08,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:08,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:26:08,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:26:08,675 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:26:08,676 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-02-06 04:26:08,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-06 04:26:08,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-06 04:26:08,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 04:26:08,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 04:26:08,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-06 04:26:08,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 04:26:08,677 INFO L422 BasicCegarLoop]: Path program histogram: [17, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:08,719 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:26:08,719 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:26:08,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:26:08 BasicIcfg [2025-02-06 04:26:08,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:26:08,723 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:26:08,723 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:26:08,723 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:26:08,724 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:25:32" (3/4) ... [2025-02-06 04:26:08,724 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:26:08,789 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-06 04:26:08,826 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:26:08,827 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:26:08,827 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:26:08,828 INFO L158 Benchmark]: Toolchain (without parser) took 37839.26ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 104.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 152.4MB. Max. memory is 16.1GB. [2025-02-06 04:26:08,828 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:26:08,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.51ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 78.6MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 04:26:08,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.33ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 75.2MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:26:08,828 INFO L158 Benchmark]: Boogie Preprocessor took 55.40ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 71.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:26:08,829 INFO L158 Benchmark]: IcfgBuilder took 639.07ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 62.4MB in the end (delta: 8.8MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2025-02-06 04:26:08,829 INFO L158 Benchmark]: TraceAbstraction took 36525.97ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 61.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2025-02-06 04:26:08,829 INFO L158 Benchmark]: Witness Printer took 104.25ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:26:08,830 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.51ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 78.6MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.33ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 75.2MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.40ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 71.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 639.07ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 62.4MB in the end (delta: 8.8MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 36525.97ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 61.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * Witness Printer took 104.25ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-3, t2322=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-3, t2322=-2, t2323=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-3, t2322=-2, t2323=-1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-3, t2322=-2, t2323=-1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-3, t2322=-2, t2323=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.4s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2200 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2180 mSDsluCounter, 579 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 563 mSDsCounter, 400 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7297 IncrementalHoareTripleChecker+Invalid, 7697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 400 mSolverCounterUnsat, 16 mSDtfsCounter, 7297 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1310occurred in iteration=15, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 603 ConstructedInterpolants, 0 QuantifiedInterpolants, 6367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 04:26:08,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE