./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c -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 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:16:10,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:16:10,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:16:10,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:16:10,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:16:10,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:16:10,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:16:10,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:16:10,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:16:10,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:16:10,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:16:10,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:16:10,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:16:10,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:16:10,269 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:16:10,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:16:10,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:16:10,269 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:16:10,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:16:10,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:16:10,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:16:10,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:16:10,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:16:10,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:16:10,270 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:16:10,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:16:10,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:16:10,270 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:16:10,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:16:10,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:16:10,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:16:10,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:16:10,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:16:10,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:16:10,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:16:10,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:16:10,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:16:10,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:16:10,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:16:10,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:16:10,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:16:10,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:16:10,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:16:10,272 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 -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-02-08 01:16:10,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:16:10,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:16:10,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:16:10,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:16:10,480 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:16:10,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-02-08 01:16:11,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/964309b9d/70f995e761b740648149607106423d23/FLAGd44dacb09 [2025-02-08 01:16:11,868 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:16:11,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-02-08 01:16:11,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/964309b9d/70f995e761b740648149607106423d23/FLAGd44dacb09 [2025-02-08 01:16:12,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/964309b9d/70f995e761b740648149607106423d23 [2025-02-08 01:16:12,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:16:12,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:16:12,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:16:12,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:16:12,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:16:12,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c9b876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12, skipping insertion in model container [2025-02-08 01:16:12,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:16:12,385 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/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2025-02-08 01:16:12,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:16:12,397 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:16:12,413 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/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2025-02-08 01:16:12,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:16:12,424 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:16:12,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12 WrapperNode [2025-02-08 01:16:12,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:16:12,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:16:12,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:16:12,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:16:12,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,463 INFO L138 Inliner]: procedures = 24, calls = 53, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 325 [2025-02-08 01:16:12,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:16:12,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:16:12,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:16:12,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:16:12,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,496 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-08 01:16:12,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:16:12,516 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:16:12,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:16:12,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:16:12,517 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (1/1) ... [2025-02-08 01:16:12,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:16:12,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:16:12,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:16:12,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:16:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:16:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:16:12,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:16:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:16:12,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:16:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:16:12,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:16:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:16:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:16:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:16:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:16:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:16:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:16:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:16:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:16:12,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:16:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:16:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:16:12,568 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:16:12,661 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:16:12,663 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:16:13,096 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:16:13,097 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:16:13,350 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:16:13,350 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:16:13,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:16:13 BoogieIcfgContainer [2025-02-08 01:16:13,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:16:13,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:16:13,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:16:13,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:16:13,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:16:12" (1/3) ... [2025-02-08 01:16:13,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b797ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:16:13, skipping insertion in model container [2025-02-08 01:16:13,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:16:12" (2/3) ... [2025-02-08 01:16:13,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b797ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:16:13, skipping insertion in model container [2025-02-08 01:16:13,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:16:13" (3/3) ... [2025-02-08 01:16:13,357 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-02-08 01:16:13,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:16:13,369 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 45 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-08 01:16:13,369 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:16:13,453 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:16:13,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 61 transitions, 143 flow [2025-02-08 01:16:13,529 INFO L124 PetriNetUnfolderBase]: 17/58 cut-off events. [2025-02-08 01:16:13,535 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:16:13,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 17/58 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 110 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2025-02-08 01:16:13,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 61 transitions, 143 flow [2025-02-08 01:16:13,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 57 transitions, 132 flow [2025-02-08 01:16:13,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:16:13,564 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;@542abb13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:16:13,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:16:13,586 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:16:13,587 INFO L124 PetriNetUnfolderBase]: 17/56 cut-off events. [2025-02-08 01:16:13,587 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:16:13,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:13,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:13,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash -950380679, now seen corresponding path program 1 times [2025-02-08 01:16:13,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:13,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775446601] [2025-02-08 01:16:13,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:13,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:16:13,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:16:13,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:13,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:13,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:13,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775446601] [2025-02-08 01:16:13,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775446601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:13,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:13,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:16:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612012115] [2025-02-08 01:16:13,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:13,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:16:13,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:13,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:16:13,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:16:13,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-02-08 01:16:13,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:13,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:13,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-02-08 01:16:13,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:14,094 INFO L124 PetriNetUnfolderBase]: 1163/1704 cut-off events. [2025-02-08 01:16:14,095 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-02-08 01:16:14,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 1704 events. 1163/1704 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6720 event pairs, 608 based on Foata normal form. 0/1341 useless extension candidates. Maximal degree in co-relation 2998. Up to 1448 conditions per place. [2025-02-08 01:16:14,114 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 37 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2025-02-08 01:16:14,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 200 flow [2025-02-08 01:16:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:16:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 01:16:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2025-02-08 01:16:14,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6557377049180327 [2025-02-08 01:16:14,126 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 132 flow. Second operand 2 states and 80 transitions. [2025-02-08 01:16:14,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 200 flow [2025-02-08 01:16:14,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 188 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:16:14,137 INFO L231 Difference]: Finished difference. Result has 45 places, 54 transitions, 114 flow [2025-02-08 01:16:14,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=54} [2025-02-08 01:16:14,142 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-02-08 01:16:14,143 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 54 transitions, 114 flow [2025-02-08 01:16:14,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:14,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:14,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:14,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:16:14,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:14,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:14,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1364642129, now seen corresponding path program 1 times [2025-02-08 01:16:14,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:14,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501125653] [2025-02-08 01:16:14,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:14,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:16:14,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:16:14,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:14,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:14,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501125653] [2025-02-08 01:16:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501125653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:14,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:14,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:16:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494865783] [2025-02-08 01:16:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:14,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:16:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:14,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:16:14,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:16:14,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-02-08 01:16:14,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 54 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:14,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:14,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-02-08 01:16:14,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:14,619 INFO L124 PetriNetUnfolderBase]: 2322/3638 cut-off events. [2025-02-08 01:16:14,619 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 01:16:14,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6587 conditions, 3638 events. 2322/3638 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18635 event pairs, 608 based on Foata normal form. 1/2845 useless extension candidates. Maximal degree in co-relation 6584. Up to 1685 conditions per place. [2025-02-08 01:16:14,641 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 59 selfloop transitions, 5 changer transitions 1/82 dead transitions. [2025-02-08 01:16:14,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 305 flow [2025-02-08 01:16:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:16:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:16:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-02-08 01:16:14,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2025-02-08 01:16:14,643 INFO L175 Difference]: Start difference. First operand has 45 places, 54 transitions, 114 flow. Second operand 3 states and 126 transitions. [2025-02-08 01:16:14,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 305 flow [2025-02-08 01:16:14,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 305 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:16:14,646 INFO L231 Difference]: Finished difference. Result has 48 places, 58 transitions, 147 flow [2025-02-08 01:16:14,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=48, PETRI_TRANSITIONS=58} [2025-02-08 01:16:14,647 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-02-08 01:16:14,647 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 58 transitions, 147 flow [2025-02-08 01:16:14,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:14,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:14,648 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:14,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:16:14,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:14,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash 412508167, now seen corresponding path program 1 times [2025-02-08 01:16:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163317019] [2025-02-08 01:16:14,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:14,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:14,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:16:14,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:16:14,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:14,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:14,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163317019] [2025-02-08 01:16:14,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163317019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:14,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:14,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:16:14,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916891739] [2025-02-08 01:16:14,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:14,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:16:14,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:14,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:16:14,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:16:14,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-02-08 01:16:14,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 58 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:14,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:14,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-02-08 01:16:14,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:15,215 INFO L124 PetriNetUnfolderBase]: 4366/6626 cut-off events. [2025-02-08 01:16:15,216 INFO L125 PetriNetUnfolderBase]: For 1043/1043 co-relation queries the response was YES. [2025-02-08 01:16:15,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13266 conditions, 6626 events. 4366/6626 cut-off events. For 1043/1043 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 35779 event pairs, 1536 based on Foata normal form. 236/5382 useless extension candidates. Maximal degree in co-relation 13261. Up to 3068 conditions per place. [2025-02-08 01:16:15,253 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 65 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-02-08 01:16:15,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 85 transitions, 353 flow [2025-02-08 01:16:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:16:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:16:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-02-08 01:16:15,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6775956284153005 [2025-02-08 01:16:15,255 INFO L175 Difference]: Start difference. First operand has 48 places, 58 transitions, 147 flow. Second operand 3 states and 124 transitions. [2025-02-08 01:16:15,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 85 transitions, 353 flow [2025-02-08 01:16:15,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:16:15,257 INFO L231 Difference]: Finished difference. Result has 50 places, 60 transitions, 167 flow [2025-02-08 01:16:15,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=60} [2025-02-08 01:16:15,258 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2025-02-08 01:16:15,258 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 60 transitions, 167 flow [2025-02-08 01:16:15,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:15,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:15,258 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:15,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:16:15,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:15,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:15,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1321841283, now seen corresponding path program 1 times [2025-02-08 01:16:15,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:15,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508571395] [2025-02-08 01:16:15,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:15,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:15,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:16:15,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:16:15,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:15,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:15,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:15,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508571395] [2025-02-08 01:16:15,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508571395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:15,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:15,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:16:15,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941273643] [2025-02-08 01:16:15,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:15,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:16:15,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:15,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:16:15,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:16:15,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-02-08 01:16:15,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 60 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:15,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:15,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-02-08 01:16:15,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:16,169 INFO L124 PetriNetUnfolderBase]: 8300/13328 cut-off events. [2025-02-08 01:16:16,170 INFO L125 PetriNetUnfolderBase]: For 3341/3365 co-relation queries the response was YES. [2025-02-08 01:16:16,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27078 conditions, 13328 events. 8300/13328 cut-off events. For 3341/3365 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 87933 event pairs, 2722 based on Foata normal form. 245/10625 useless extension candidates. Maximal degree in co-relation 27072. Up to 5665 conditions per place. [2025-02-08 01:16:16,236 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 74 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-02-08 01:16:16,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 422 flow [2025-02-08 01:16:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:16:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:16:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-02-08 01:16:16,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2025-02-08 01:16:16,237 INFO L175 Difference]: Start difference. First operand has 50 places, 60 transitions, 167 flow. Second operand 3 states and 126 transitions. [2025-02-08 01:16:16,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 422 flow [2025-02-08 01:16:16,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 93 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:16:16,242 INFO L231 Difference]: Finished difference. Result has 52 places, 61 transitions, 178 flow [2025-02-08 01:16:16,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=52, PETRI_TRANSITIONS=61} [2025-02-08 01:16:16,243 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-02-08 01:16:16,243 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 61 transitions, 178 flow [2025-02-08 01:16:16,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:16,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:16,244 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:16,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:16:16,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:16,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash -104544209, now seen corresponding path program 1 times [2025-02-08 01:16:16,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:16,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287915754] [2025-02-08 01:16:16,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:16,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:16,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:16:16,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:16:16,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:16,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:16,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:16,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287915754] [2025-02-08 01:16:16,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287915754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:16,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:16,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:16:16,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392609513] [2025-02-08 01:16:16,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:16,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:16:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:16,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:16:16,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:16:16,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2025-02-08 01:16:16,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 61 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:16,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:16,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2025-02-08 01:16:16,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:17,272 INFO L124 PetriNetUnfolderBase]: 13306/19339 cut-off events. [2025-02-08 01:16:17,273 INFO L125 PetriNetUnfolderBase]: For 6517/6531 co-relation queries the response was YES. [2025-02-08 01:16:17,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42408 conditions, 19339 events. 13306/19339 cut-off events. For 6517/6531 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 113300 event pairs, 6178 based on Foata normal form. 0/15600 useless extension candidates. Maximal degree in co-relation 42401. Up to 10586 conditions per place. [2025-02-08 01:16:17,468 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 69 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-02-08 01:16:17,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 420 flow [2025-02-08 01:16:17,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:16:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:16:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-02-08 01:16:17,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6338797814207651 [2025-02-08 01:16:17,470 INFO L175 Difference]: Start difference. First operand has 52 places, 61 transitions, 178 flow. Second operand 3 states and 116 transitions. [2025-02-08 01:16:17,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 420 flow [2025-02-08 01:16:17,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:16:17,477 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 206 flow [2025-02-08 01:16:17,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2025-02-08 01:16:17,478 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-02-08 01:16:17,478 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 206 flow [2025-02-08 01:16:17,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:17,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:17,478 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:17,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:16:17,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:17,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:17,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1910903757, now seen corresponding path program 1 times [2025-02-08 01:16:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:17,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609015146] [2025-02-08 01:16:17,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:17,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:17,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 01:16:17,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:16:17,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:17,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609015146] [2025-02-08 01:16:17,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609015146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:17,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:17,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:16:17,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991287001] [2025-02-08 01:16:17,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:17,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:16:17,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:17,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:16:17,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:16:17,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-02-08 01:16:17,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:17,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:17,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-02-08 01:16:17,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:18,653 INFO L124 PetriNetUnfolderBase]: 12900/19830 cut-off events. [2025-02-08 01:16:18,653 INFO L125 PetriNetUnfolderBase]: For 9546/9728 co-relation queries the response was YES. [2025-02-08 01:16:18,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43792 conditions, 19830 events. 12900/19830 cut-off events. For 9546/9728 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 128175 event pairs, 9082 based on Foata normal form. 318/16318 useless extension candidates. Maximal degree in co-relation 43784. Up to 13549 conditions per place. [2025-02-08 01:16:18,777 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 74 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2025-02-08 01:16:18,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 95 transitions, 446 flow [2025-02-08 01:16:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:16:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:16:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2025-02-08 01:16:18,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6147540983606558 [2025-02-08 01:16:18,778 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 206 flow. Second operand 4 states and 150 transitions. [2025-02-08 01:16:18,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 95 transitions, 446 flow [2025-02-08 01:16:18,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:16:18,798 INFO L231 Difference]: Finished difference. Result has 58 places, 64 transitions, 216 flow [2025-02-08 01:16:18,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=58, PETRI_TRANSITIONS=64} [2025-02-08 01:16:18,800 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2025-02-08 01:16:18,800 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 64 transitions, 216 flow [2025-02-08 01:16:18,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:18,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:18,801 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:18,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:16:18,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:18,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:18,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1113162744, now seen corresponding path program 1 times [2025-02-08 01:16:18,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:18,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543630010] [2025-02-08 01:16:18,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:18,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:18,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:16:18,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:16:18,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:18,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:19,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:19,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543630010] [2025-02-08 01:16:19,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543630010] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:16:19,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317485343] [2025-02-08 01:16:19,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:19,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:16:19,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:16:19,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:16:19,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:16:19,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:16:19,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:16:19,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:19,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:19,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 01:16:19,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:16:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:16:19,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:16:19,647 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 01:16:19,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 01:16:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:16:19,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317485343] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:16:19,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:16:19,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-08 01:16:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469581962] [2025-02-08 01:16:19,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:16:19,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 01:16:19,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:19,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 01:16:19,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-08 01:16:19,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-02-08 01:16:19,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 64 transitions, 216 flow. Second operand has 15 states, 15 states have (on average 24.866666666666667) internal successors, (373), 15 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:19,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:19,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-02-08 01:16:19,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:22,518 INFO L124 PetriNetUnfolderBase]: 30836/46390 cut-off events. [2025-02-08 01:16:22,518 INFO L125 PetriNetUnfolderBase]: For 21389/22251 co-relation queries the response was YES. [2025-02-08 01:16:22,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103665 conditions, 46390 events. 30836/46390 cut-off events. For 21389/22251 co-relation queries the response was YES. Maximal size of possible extension queue 1443. Compared 321859 event pairs, 3257 based on Foata normal form. 86/37345 useless extension candidates. Maximal degree in co-relation 103655. Up to 9268 conditions per place. [2025-02-08 01:16:22,737 INFO L140 encePairwiseOnDemand]: 45/61 looper letters, 338 selfloop transitions, 93 changer transitions 5/454 dead transitions. [2025-02-08 01:16:22,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 454 transitions, 2214 flow [2025-02-08 01:16:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 01:16:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-02-08 01:16:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 919 transitions. [2025-02-08 01:16:22,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6026229508196721 [2025-02-08 01:16:22,741 INFO L175 Difference]: Start difference. First operand has 58 places, 64 transitions, 216 flow. Second operand 25 states and 919 transitions. [2025-02-08 01:16:22,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 454 transitions, 2214 flow [2025-02-08 01:16:22,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 454 transitions, 2210 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 01:16:22,758 INFO L231 Difference]: Finished difference. Result has 83 places, 178 transitions, 885 flow [2025-02-08 01:16:22,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=885, PETRI_PLACES=83, PETRI_TRANSITIONS=178} [2025-02-08 01:16:22,759 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2025-02-08 01:16:22,759 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 178 transitions, 885 flow [2025-02-08 01:16:22,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 24.866666666666667) internal successors, (373), 15 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:22,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:22,762 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:22,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 01:16:22,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:16:22,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:22,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:22,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1422743769, now seen corresponding path program 1 times [2025-02-08 01:16:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:22,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102573626] [2025-02-08 01:16:22,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:22,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:22,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:16:22,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:16:22,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:22,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:16:23,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:23,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102573626] [2025-02-08 01:16:23,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102573626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:23,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:23,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:16:23,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433047199] [2025-02-08 01:16:23,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:23,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:16:23,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:23,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:16:23,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:16:23,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 61 [2025-02-08 01:16:23,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 178 transitions, 885 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:23,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:23,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 61 [2025-02-08 01:16:23,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:25,246 INFO L124 PetriNetUnfolderBase]: 29445/43133 cut-off events. [2025-02-08 01:16:25,246 INFO L125 PetriNetUnfolderBase]: For 29600/30987 co-relation queries the response was YES. [2025-02-08 01:16:25,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112580 conditions, 43133 events. 29445/43133 cut-off events. For 29600/30987 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 267397 event pairs, 10037 based on Foata normal form. 60/35925 useless extension candidates. Maximal degree in co-relation 112568. Up to 23125 conditions per place. [2025-02-08 01:16:25,771 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 142 selfloop transitions, 10 changer transitions 1/166 dead transitions. [2025-02-08 01:16:25,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 166 transitions, 1053 flow [2025-02-08 01:16:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:16:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:16:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-02-08 01:16:25,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6120218579234973 [2025-02-08 01:16:25,773 INFO L175 Difference]: Start difference. First operand has 83 places, 178 transitions, 885 flow. Second operand 3 states and 112 transitions. [2025-02-08 01:16:25,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 166 transitions, 1053 flow [2025-02-08 01:16:25,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 166 transitions, 1027 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-02-08 01:16:25,897 INFO L231 Difference]: Finished difference. Result has 77 places, 134 transitions, 632 flow [2025-02-08 01:16:25,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=77, PETRI_TRANSITIONS=134} [2025-02-08 01:16:25,900 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2025-02-08 01:16:25,900 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 134 transitions, 632 flow [2025-02-08 01:16:25,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:25,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:25,900 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:25,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:16:25,900 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:25,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:25,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1992518501, now seen corresponding path program 1 times [2025-02-08 01:16:25,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:25,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381738271] [2025-02-08 01:16:25,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:25,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:25,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 01:16:25,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 01:16:25,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:25,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:16:25,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:25,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381738271] [2025-02-08 01:16:25,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381738271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:25,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:25,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:16:25,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27281861] [2025-02-08 01:16:25,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:25,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:16:25,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:25,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:16:25,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:16:25,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2025-02-08 01:16:25,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 134 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:25,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:25,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2025-02-08 01:16:25,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:27,820 INFO L124 PetriNetUnfolderBase]: 26061/39324 cut-off events. [2025-02-08 01:16:27,821 INFO L125 PetriNetUnfolderBase]: For 37129/39513 co-relation queries the response was YES. [2025-02-08 01:16:27,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104793 conditions, 39324 events. 26061/39324 cut-off events. For 37129/39513 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 262326 event pairs, 11640 based on Foata normal form. 44/31953 useless extension candidates. Maximal degree in co-relation 104779. Up to 28634 conditions per place. [2025-02-08 01:16:28,023 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 127 selfloop transitions, 5 changer transitions 4/152 dead transitions. [2025-02-08 01:16:28,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 152 transitions, 953 flow [2025-02-08 01:16:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:16:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:16:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-02-08 01:16:28,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6338797814207651 [2025-02-08 01:16:28,025 INFO L175 Difference]: Start difference. First operand has 77 places, 134 transitions, 632 flow. Second operand 3 states and 116 transitions. [2025-02-08 01:16:28,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 152 transitions, 953 flow [2025-02-08 01:16:28,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 152 transitions, 914 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:16:28,106 INFO L231 Difference]: Finished difference. Result has 76 places, 125 transitions, 557 flow [2025-02-08 01:16:28,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=557, PETRI_PLACES=76, PETRI_TRANSITIONS=125} [2025-02-08 01:16:28,108 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 26 predicate places. [2025-02-08 01:16:28,108 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 125 transitions, 557 flow [2025-02-08 01:16:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:28,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:28,108 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:28,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:16:28,108 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:28,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:28,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1598415834, now seen corresponding path program 1 times [2025-02-08 01:16:28,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:28,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938712861] [2025-02-08 01:16:28,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:28,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 01:16:28,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 01:16:28,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:28,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:16:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938712861] [2025-02-08 01:16:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938712861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:28,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:16:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210453770] [2025-02-08 01:16:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:28,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:16:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:28,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:16:28,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:16:28,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-02-08 01:16:28,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 125 transitions, 557 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:28,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:28,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-02-08 01:16:28,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:30,015 INFO L124 PetriNetUnfolderBase]: 17556/27756 cut-off events. [2025-02-08 01:16:30,015 INFO L125 PetriNetUnfolderBase]: For 32094/34023 co-relation queries the response was YES. [2025-02-08 01:16:30,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74664 conditions, 27756 events. 17556/27756 cut-off events. For 32094/34023 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 182302 event pairs, 4306 based on Foata normal form. 400/22441 useless extension candidates. Maximal degree in co-relation 74650. Up to 14810 conditions per place. [2025-02-08 01:16:30,124 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 120 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-02-08 01:16:30,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 870 flow [2025-02-08 01:16:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:16:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:16:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-02-08 01:16:30,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-08 01:16:30,126 INFO L175 Difference]: Start difference. First operand has 76 places, 125 transitions, 557 flow. Second operand 3 states and 122 transitions. [2025-02-08 01:16:30,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 870 flow [2025-02-08 01:16:30,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 142 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:16:30,142 INFO L231 Difference]: Finished difference. Result has 75 places, 110 transitions, 479 flow [2025-02-08 01:16:30,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=479, PETRI_PLACES=75, PETRI_TRANSITIONS=110} [2025-02-08 01:16:30,147 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 25 predicate places. [2025-02-08 01:16:30,147 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 110 transitions, 479 flow [2025-02-08 01:16:30,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:30,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:30,147 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:30,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:16:30,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:30,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1654103664, now seen corresponding path program 2 times [2025-02-08 01:16:30,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:30,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569287033] [2025-02-08 01:16:30,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:16:30,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:30,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-08 01:16:30,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 01:16:30,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:16:30,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:16:30,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:30,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569287033] [2025-02-08 01:16:30,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569287033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:30,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:30,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:16:30,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456992941] [2025-02-08 01:16:30,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:30,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:16:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:30,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:16:30,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:16:30,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 61 [2025-02-08 01:16:30,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 110 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:30,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:30,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 61 [2025-02-08 01:16:30,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:31,965 INFO L124 PetriNetUnfolderBase]: 24212/35759 cut-off events. [2025-02-08 01:16:31,965 INFO L125 PetriNetUnfolderBase]: For 32900/34341 co-relation queries the response was YES. [2025-02-08 01:16:32,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98443 conditions, 35759 events. 24212/35759 cut-off events. For 32900/34341 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 217135 event pairs, 6685 based on Foata normal form. 0/30377 useless extension candidates. Maximal degree in co-relation 98428. Up to 19523 conditions per place. [2025-02-08 01:16:32,131 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 117 selfloop transitions, 6 changer transitions 0/137 dead transitions. [2025-02-08 01:16:32,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 137 transitions, 839 flow [2025-02-08 01:16:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:16:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:16:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-02-08 01:16:32,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5956284153005464 [2025-02-08 01:16:32,132 INFO L175 Difference]: Start difference. First operand has 75 places, 110 transitions, 479 flow. Second operand 3 states and 109 transitions. [2025-02-08 01:16:32,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 137 transitions, 839 flow [2025-02-08 01:16:32,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 137 transitions, 837 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:16:32,159 INFO L231 Difference]: Finished difference. Result has 76 places, 109 transitions, 485 flow [2025-02-08 01:16:32,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=76, PETRI_TRANSITIONS=109} [2025-02-08 01:16:32,160 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 26 predicate places. [2025-02-08 01:16:32,160 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 109 transitions, 485 flow [2025-02-08 01:16:32,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:32,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:32,160 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:32,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:16:32,160 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:32,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:32,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1387400895, now seen corresponding path program 1 times [2025-02-08 01:16:32,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:32,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918758506] [2025-02-08 01:16:32,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:32,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:32,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 01:16:32,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:16:32,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:32,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:16:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918758506] [2025-02-08 01:16:32,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918758506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:32,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:32,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:16:32,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519236980] [2025-02-08 01:16:32,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:32,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:16:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:32,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:16:32,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:16:32,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 61 [2025-02-08 01:16:32,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 109 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:32,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:32,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 61 [2025-02-08 01:16:32,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:34,204 INFO L124 PetriNetUnfolderBase]: 20478/29955 cut-off events. [2025-02-08 01:16:34,205 INFO L125 PetriNetUnfolderBase]: For 33840/35715 co-relation queries the response was YES. [2025-02-08 01:16:34,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83960 conditions, 29955 events. 20478/29955 cut-off events. For 33840/35715 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 174193 event pairs, 8017 based on Foata normal form. 0/25175 useless extension candidates. Maximal degree in co-relation 83945. Up to 20990 conditions per place. [2025-02-08 01:16:34,345 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 117 selfloop transitions, 7 changer transitions 0/138 dead transitions. [2025-02-08 01:16:34,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 853 flow [2025-02-08 01:16:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:16:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:16:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-02-08 01:16:34,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6010928961748634 [2025-02-08 01:16:34,347 INFO L175 Difference]: Start difference. First operand has 76 places, 109 transitions, 485 flow. Second operand 3 states and 110 transitions. [2025-02-08 01:16:34,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 853 flow [2025-02-08 01:16:34,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 138 transitions, 841 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:16:34,368 INFO L231 Difference]: Finished difference. Result has 78 places, 110 transitions, 507 flow [2025-02-08 01:16:34,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=507, PETRI_PLACES=78, PETRI_TRANSITIONS=110} [2025-02-08 01:16:34,368 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 28 predicate places. [2025-02-08 01:16:34,370 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 110 transitions, 507 flow [2025-02-08 01:16:34,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:34,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:34,370 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:34,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:16:34,370 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:34,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash -597149762, now seen corresponding path program 1 times [2025-02-08 01:16:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:34,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725031195] [2025-02-08 01:16:34,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:34,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:34,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 01:16:34,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 01:16:34,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:34,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:16:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725031195] [2025-02-08 01:16:34,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725031195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:16:34,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:16:34,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:16:34,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916247990] [2025-02-08 01:16:34,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:16:34,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:16:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:34,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:16:34,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:16:34,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-02-08 01:16:34,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 110 transitions, 507 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:34,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:34,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-02-08 01:16:34,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:35,911 INFO L124 PetriNetUnfolderBase]: 18388/28913 cut-off events. [2025-02-08 01:16:35,912 INFO L125 PetriNetUnfolderBase]: For 35711/37679 co-relation queries the response was YES. [2025-02-08 01:16:35,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79458 conditions, 28913 events. 18388/28913 cut-off events. For 35711/37679 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 188940 event pairs, 9571 based on Foata normal form. 40/23700 useless extension candidates. Maximal degree in co-relation 79442. Up to 20716 conditions per place. [2025-02-08 01:16:36,081 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 88 selfloop transitions, 3 changer transitions 61/172 dead transitions. [2025-02-08 01:16:36,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 172 transitions, 1065 flow [2025-02-08 01:16:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:16:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:16:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2025-02-08 01:16:36,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5860655737704918 [2025-02-08 01:16:36,291 INFO L175 Difference]: Start difference. First operand has 78 places, 110 transitions, 507 flow. Second operand 4 states and 143 transitions. [2025-02-08 01:16:36,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 172 transitions, 1065 flow [2025-02-08 01:16:36,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 172 transitions, 1047 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:16:36,341 INFO L231 Difference]: Finished difference. Result has 81 places, 111 transitions, 511 flow [2025-02-08 01:16:36,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=511, PETRI_PLACES=81, PETRI_TRANSITIONS=111} [2025-02-08 01:16:36,342 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 31 predicate places. [2025-02-08 01:16:36,342 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 111 transitions, 511 flow [2025-02-08 01:16:36,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:36,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:36,342 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:36,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:16:36,342 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:36,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:36,343 INFO L85 PathProgramCache]: Analyzing trace with hash 867179312, now seen corresponding path program 1 times [2025-02-08 01:16:36,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:36,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241800053] [2025-02-08 01:16:36,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:36,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:36,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 01:16:36,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 01:16:36,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:36,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:16:36,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:36,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241800053] [2025-02-08 01:16:36,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241800053] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:16:36,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373677855] [2025-02-08 01:16:36,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:36,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:16:36,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:16:36,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:16:36,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:16:36,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 01:16:36,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 01:16:36,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:36,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:36,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 01:16:36,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:16:36,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 01:16:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:16:37,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:16:37,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-02-08 01:16:37,288 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 01:16:37,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-02-08 01:16:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:16:37,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373677855] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:16:37,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:16:37,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2025-02-08 01:16:37,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916488497] [2025-02-08 01:16:37,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:16:37,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 01:16:37,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:37,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 01:16:37,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-02-08 01:16:37,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-02-08 01:16:37,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 111 transitions, 511 flow. Second operand has 21 states, 21 states have (on average 24.857142857142858) internal successors, (522), 21 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:37,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:37,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-02-08 01:16:37,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:16:45,492 INFO L124 PetriNetUnfolderBase]: 69596/107729 cut-off events. [2025-02-08 01:16:45,492 INFO L125 PetriNetUnfolderBase]: For 121326/129078 co-relation queries the response was YES. [2025-02-08 01:16:45,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294383 conditions, 107729 events. 69596/107729 cut-off events. For 121326/129078 co-relation queries the response was YES. Maximal size of possible extension queue 2172. Compared 813087 event pairs, 12216 based on Foata normal form. 48/87577 useless extension candidates. Maximal degree in co-relation 294365. Up to 25626 conditions per place. [2025-02-08 01:16:46,093 INFO L140 encePairwiseOnDemand]: 42/61 looper letters, 477 selfloop transitions, 90 changer transitions 21/608 dead transitions. [2025-02-08 01:16:46,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 608 transitions, 3800 flow [2025-02-08 01:16:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-08 01:16:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-02-08 01:16:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 917 transitions. [2025-02-08 01:16:46,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5567698846387371 [2025-02-08 01:16:46,095 INFO L175 Difference]: Start difference. First operand has 81 places, 111 transitions, 511 flow. Second operand 27 states and 917 transitions. [2025-02-08 01:16:46,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 608 transitions, 3800 flow [2025-02-08 01:16:46,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 608 transitions, 3780 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-08 01:16:46,243 INFO L231 Difference]: Finished difference. Result has 119 places, 193 transitions, 1420 flow [2025-02-08 01:16:46,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1420, PETRI_PLACES=119, PETRI_TRANSITIONS=193} [2025-02-08 01:16:46,243 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 69 predicate places. [2025-02-08 01:16:46,243 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 193 transitions, 1420 flow [2025-02-08 01:16:46,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 24.857142857142858) internal successors, (522), 21 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:46,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:16:46,244 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:16:46,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:16:46,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:16:46,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:16:46,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:16:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash -143239299, now seen corresponding path program 1 times [2025-02-08 01:16:46,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:16:46,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889126236] [2025-02-08 01:16:46,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:16:46,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 01:16:46,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 01:16:46,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:46,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:16:46,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:16:46,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889126236] [2025-02-08 01:16:46,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889126236] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:16:46,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230644974] [2025-02-08 01:16:46,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:16:46,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:16:46,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:16:46,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:16:46,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:16:46,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 01:16:46,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 01:16:46,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:16:46,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:16:46,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:16:46,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:16:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:16:46,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:16:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:16:46,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230644974] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:16:46,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:16:46,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-02-08 01:16:46,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122051230] [2025-02-08 01:16:46,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:16:46,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 01:16:46,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:16:46,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 01:16:46,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:16:46,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-02-08 01:16:46,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 193 transitions, 1420 flow. Second operand has 13 states, 13 states have (on average 24.307692307692307) internal successors, (316), 13 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:16:46,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:16:46,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-02-08 01:16:46,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand