./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:48:28,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:48:28,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:48:28,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:48:28,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:48:28,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:48:28,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:48:28,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:48:28,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:48:28,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:48:28,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:48:28,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:48:28,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:48:28,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:48:28,148 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:48:28,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:48:28,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:48:28,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:48:28,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:48:28,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:48:28,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:48:28,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:48:28,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:48:28,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:48:28,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:48:28,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:48:28,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:48:28,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:48:28,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:48:28,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:48:28,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:48:28,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:48:28,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:48:28,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:48:28,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:48:28,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:48:28,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:48:28,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:48:28,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:48:28,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:48:28,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:48:28,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:48:28,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:48:28,153 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 [2025-03-13 21:48:28,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:48:28,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:48:28,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:48:28,395 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:48:28,395 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:48:28,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2025-03-13 21:48:29,595 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b1f0dac/9426e6519b8148c6af13b7f796cbce17/FLAG89ee23be5 [2025-03-13 21:48:29,807 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:48:29,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2025-03-13 21:48:29,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b1f0dac/9426e6519b8148c6af13b7f796cbce17/FLAG89ee23be5 [2025-03-13 21:48:29,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b1f0dac/9426e6519b8148c6af13b7f796cbce17 [2025-03-13 21:48:29,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:48:29,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:48:29,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:48:29,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:48:29,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:48:29,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:48:29" (1/1) ... [2025-03-13 21:48:29,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19211522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:29, skipping insertion in model container [2025-03-13 21:48:29,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:48:29" (1/1) ... [2025-03-13 21:48:29,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:48:30,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2025-03-13 21:48:30,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:48:30,033 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:48:30,060 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2025-03-13 21:48:30,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:48:30,076 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:48:30,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30 WrapperNode [2025-03-13 21:48:30,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:48:30,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:48:30,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:48:30,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:48:30,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,109 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 315 [2025-03-13 21:48:30,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:48:30,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:48:30,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:48:30,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:48:30,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,130 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 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-03-13 21:48:30,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:48:30,150 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:48:30,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:48:30,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:48:30,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (1/1) ... [2025-03-13 21:48:30,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:48:30,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:48:30,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:48:30,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:48:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:48:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:48:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:48:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:48:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:48:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:48:30,193 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:48:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:48:30,193 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:48:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:48:30,193 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:48:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 21:48:30,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 21:48:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:48:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:48:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:48:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:48:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:48:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:48:30,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:48:30,195 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:48:30,279 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:48:30,281 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:48:30,659 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:48:30,660 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:48:30,660 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:48:30,982 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:48:30,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:48:30 BoogieIcfgContainer [2025-03-13 21:48:30,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:48:30,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:48:30,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:48:30,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:48:30,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:48:29" (1/3) ... [2025-03-13 21:48:30,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b13a50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:48:30, skipping insertion in model container [2025-03-13 21:48:30,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:48:30" (2/3) ... [2025-03-13 21:48:30,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b13a50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:48:30, skipping insertion in model container [2025-03-13 21:48:30,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:48:30" (3/3) ... [2025-03-13 21:48:30,990 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2025-03-13 21:48:31,003 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:48:31,005 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series2.wvr.c that has 5 procedures, 44 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-13 21:48:31,005 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:48:31,057 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:48:31,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 128 flow [2025-03-13 21:48:31,115 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2025-03-13 21:48:31,118 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:48:31,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 7/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-13 21:48:31,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 128 flow [2025-03-13 21:48:31,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 45 transitions, 114 flow [2025-03-13 21:48:31,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:48:31,144 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;@7f3d8081, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:48:31,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:48:31,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:48:31,161 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2025-03-13 21:48:31,161 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:48:31,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:31,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:31,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:48:31,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:31,166 INFO L85 PathProgramCache]: Analyzing trace with hash 685516359, now seen corresponding path program 1 times [2025-03-13 21:48:31,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:31,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306427327] [2025-03-13 21:48:31,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:31,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:48:31,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:48:31,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:31,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:31,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:31,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306427327] [2025-03-13 21:48:31,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306427327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:31,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:31,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:48:31,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428436878] [2025-03-13 21:48:31,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:31,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:48:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:31,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:48:31,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:48:31,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:48:31,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:31,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:31,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:48:31,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:32,102 INFO L124 PetriNetUnfolderBase]: 3683/5094 cut-off events. [2025-03-13 21:48:32,102 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2025-03-13 21:48:32,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10280 conditions, 5094 events. 3683/5094 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 24720 event pairs, 1024 based on Foata normal form. 1/4970 useless extension candidates. Maximal degree in co-relation 9160. Up to 3095 conditions per place. [2025-03-13 21:48:32,145 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 53 selfloop transitions, 3 changer transitions 1/66 dead transitions. [2025-03-13 21:48:32,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 285 flow [2025-03-13 21:48:32,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:48:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:48:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-13 21:48:32,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2025-03-13 21:48:32,159 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 114 flow. Second operand 3 states and 97 transitions. [2025-03-13 21:48:32,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 285 flow [2025-03-13 21:48:32,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 259 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:48:32,173 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 117 flow [2025-03-13 21:48:32,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2025-03-13 21:48:32,180 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-03-13 21:48:32,180 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 117 flow [2025-03-13 21:48:32,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:32,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:32,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:32,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:48:32,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:48:32,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash -820236404, now seen corresponding path program 1 times [2025-03-13 21:48:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:32,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521402764] [2025-03-13 21:48:32,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:32,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:48:32,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:48:32,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:32,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:32,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:32,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521402764] [2025-03-13 21:48:32,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521402764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:32,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:32,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:48:32,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763986222] [2025-03-13 21:48:32,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:32,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:48:32,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:32,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:48:32,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:48:32,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:48:32,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:32,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:32,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:48:32,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:32,970 INFO L124 PetriNetUnfolderBase]: 4691/6608 cut-off events. [2025-03-13 21:48:32,970 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2025-03-13 21:48:32,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13881 conditions, 6608 events. 4691/6608 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 34892 event pairs, 1685 based on Foata normal form. 186/6711 useless extension candidates. Maximal degree in co-relation 5587. Up to 3904 conditions per place. [2025-03-13 21:48:33,001 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 61 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-13 21:48:33,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 307 flow [2025-03-13 21:48:33,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:48:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:48:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-03-13 21:48:33,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-13 21:48:33,004 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 117 flow. Second operand 3 states and 100 transitions. [2025-03-13 21:48:33,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 307 flow [2025-03-13 21:48:33,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:33,006 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 128 flow [2025-03-13 21:48:33,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2025-03-13 21:48:33,007 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-03-13 21:48:33,007 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 128 flow [2025-03-13 21:48:33,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:33,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:33,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:33,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:48:33,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:48:33,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash -195990480, now seen corresponding path program 1 times [2025-03-13 21:48:33,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:33,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352164108] [2025-03-13 21:48:33,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:33,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:33,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:48:33,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:48:33,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:33,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:33,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352164108] [2025-03-13 21:48:33,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352164108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:33,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:33,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:48:33,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777499349] [2025-03-13 21:48:33,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:33,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:48:33,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:33,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:48:33,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:48:33,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:48:33,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:33,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:33,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:48:33,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:33,832 INFO L124 PetriNetUnfolderBase]: 5825/8336 cut-off events. [2025-03-13 21:48:33,832 INFO L125 PetriNetUnfolderBase]: For 2259/2259 co-relation queries the response was YES. [2025-03-13 21:48:33,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18106 conditions, 8336 events. 5825/8336 cut-off events. For 2259/2259 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 45473 event pairs, 2031 based on Foata normal form. 138/8390 useless extension candidates. Maximal degree in co-relation 11513. Up to 4926 conditions per place. [2025-03-13 21:48:33,899 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 61 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-13 21:48:33,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 323 flow [2025-03-13 21:48:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:48:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:48:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-03-13 21:48:33,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-03-13 21:48:33,902 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 128 flow. Second operand 3 states and 98 transitions. [2025-03-13 21:48:33,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 323 flow [2025-03-13 21:48:33,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:33,908 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 140 flow [2025-03-13 21:48:33,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2025-03-13 21:48:33,909 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2025-03-13 21:48:33,909 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 140 flow [2025-03-13 21:48:33,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:33,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:33,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:33,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:48:33,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:48:33,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash -311527695, now seen corresponding path program 1 times [2025-03-13 21:48:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:33,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163458750] [2025-03-13 21:48:33,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:33,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:33,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:48:33,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:48:33,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:33,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:34,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:34,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163458750] [2025-03-13 21:48:34,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163458750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:34,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:34,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:48:34,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264437160] [2025-03-13 21:48:34,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:34,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:48:34,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:34,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:48:34,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:48:34,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:48:34,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:34,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:34,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:48:34,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:34,737 INFO L124 PetriNetUnfolderBase]: 7724/11131 cut-off events. [2025-03-13 21:48:34,737 INFO L125 PetriNetUnfolderBase]: For 4122/4122 co-relation queries the response was YES. [2025-03-13 21:48:34,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25180 conditions, 11131 events. 7724/11131 cut-off events. For 4122/4122 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 64502 event pairs, 6327 based on Foata normal form. 211/11224 useless extension candidates. Maximal degree in co-relation 13294. Up to 7788 conditions per place. [2025-03-13 21:48:34,782 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 70 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2025-03-13 21:48:34,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 375 flow [2025-03-13 21:48:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:48:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:48:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-13 21:48:34,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-13 21:48:34,785 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 140 flow. Second operand 4 states and 120 transitions. [2025-03-13 21:48:34,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 375 flow [2025-03-13 21:48:34,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:34,789 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 158 flow [2025-03-13 21:48:34,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-03-13 21:48:34,789 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2025-03-13 21:48:34,789 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 158 flow [2025-03-13 21:48:34,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:34,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:34,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:34,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:48:34,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:48:34,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1759052763, now seen corresponding path program 1 times [2025-03-13 21:48:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:34,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214559587] [2025-03-13 21:48:34,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:34,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:34,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:48:34,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:48:34,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:34,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:48:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214559587] [2025-03-13 21:48:34,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214559587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:34,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:34,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:48:34,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560826882] [2025-03-13 21:48:34,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:34,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:48:34,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:34,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:48:34,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:48:34,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:48:34,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:34,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:34,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:48:34,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:35,809 INFO L124 PetriNetUnfolderBase]: 10322/15088 cut-off events. [2025-03-13 21:48:35,809 INFO L125 PetriNetUnfolderBase]: For 5630/5630 co-relation queries the response was YES. [2025-03-13 21:48:35,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33514 conditions, 15088 events. 10322/15088 cut-off events. For 5630/5630 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 93281 event pairs, 8685 based on Foata normal form. 335/15270 useless extension candidates. Maximal degree in co-relation 25641. Up to 10448 conditions per place. [2025-03-13 21:48:35,888 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 69 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2025-03-13 21:48:35,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 398 flow [2025-03-13 21:48:35,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:48:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:48:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-13 21:48:35,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532 [2025-03-13 21:48:35,893 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 158 flow. Second operand 5 states and 133 transitions. [2025-03-13 21:48:35,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 398 flow [2025-03-13 21:48:35,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 84 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:35,897 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 193 flow [2025-03-13 21:48:35,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-03-13 21:48:35,898 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2025-03-13 21:48:35,898 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 193 flow [2025-03-13 21:48:35,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:35,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:35,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:35,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:48:35,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:48:35,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash 585961973, now seen corresponding path program 1 times [2025-03-13 21:48:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:35,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854627852] [2025-03-13 21:48:35,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:35,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:35,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:48:35,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:48:35,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:35,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:48:36,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:36,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854627852] [2025-03-13 21:48:36,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854627852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:36,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:36,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:48:36,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829629880] [2025-03-13 21:48:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:36,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:48:36,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:36,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:48:36,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:48:36,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-13 21:48:36,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:36,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:36,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-13 21:48:36,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:37,656 INFO L124 PetriNetUnfolderBase]: 18964/27287 cut-off events. [2025-03-13 21:48:37,657 INFO L125 PetriNetUnfolderBase]: For 8840/8891 co-relation queries the response was YES. [2025-03-13 21:48:37,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60809 conditions, 27287 events. 18964/27287 cut-off events. For 8840/8891 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 177810 event pairs, 8099 based on Foata normal form. 21/26020 useless extension candidates. Maximal degree in co-relation 46956. Up to 9991 conditions per place. [2025-03-13 21:48:37,774 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 109 selfloop transitions, 9 changer transitions 0/126 dead transitions. [2025-03-13 21:48:37,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 126 transitions, 638 flow [2025-03-13 21:48:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:48:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:48:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2025-03-13 21:48:37,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2025-03-13 21:48:37,777 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 193 flow. Second operand 6 states and 176 transitions. [2025-03-13 21:48:37,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 126 transitions, 638 flow [2025-03-13 21:48:37,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 126 transitions, 631 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:37,782 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 232 flow [2025-03-13 21:48:37,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2025-03-13 21:48:37,782 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2025-03-13 21:48:37,783 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 232 flow [2025-03-13 21:48:37,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:37,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:37,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:37,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:48:37,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:48:37,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:37,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1137195063, now seen corresponding path program 1 times [2025-03-13 21:48:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:37,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033454757] [2025-03-13 21:48:37,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:37,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:37,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:48:37,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:48:37,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:37,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:48:38,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:38,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033454757] [2025-03-13 21:48:38,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033454757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:38,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:38,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:48:38,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183975567] [2025-03-13 21:48:38,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:38,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:48:38,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:38,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:48:38,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:48:38,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-13 21:48:38,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:38,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:38,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-13 21:48:38,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:39,377 INFO L124 PetriNetUnfolderBase]: 15658/22751 cut-off events. [2025-03-13 21:48:39,378 INFO L125 PetriNetUnfolderBase]: For 9960/9972 co-relation queries the response was YES. [2025-03-13 21:48:39,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52543 conditions, 22751 events. 15658/22751 cut-off events. For 9960/9972 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 147842 event pairs, 7178 based on Foata normal form. 5/21606 useless extension candidates. Maximal degree in co-relation 37760. Up to 9197 conditions per place. [2025-03-13 21:48:39,502 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 67 selfloop transitions, 6 changer transitions 35/116 dead transitions. [2025-03-13 21:48:39,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 116 transitions, 606 flow [2025-03-13 21:48:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:48:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:48:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2025-03-13 21:48:39,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-13 21:48:39,503 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 232 flow. Second operand 6 states and 170 transitions. [2025-03-13 21:48:39,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 116 transitions, 606 flow [2025-03-13 21:48:39,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 116 transitions, 594 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-13 21:48:39,511 INFO L231 Difference]: Finished difference. Result has 72 places, 55 transitions, 214 flow [2025-03-13 21:48:39,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=72, PETRI_TRANSITIONS=55} [2025-03-13 21:48:39,512 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2025-03-13 21:48:39,512 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 55 transitions, 214 flow [2025-03-13 21:48:39,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:39,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:39,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:39,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:48:39,513 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 2 more)] === [2025-03-13 21:48:39,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:39,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1895032405, now seen corresponding path program 1 times [2025-03-13 21:48:39,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:39,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844236823] [2025-03-13 21:48:39,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:39,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:48:39,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:48:39,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:39,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:48:39,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:39,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844236823] [2025-03-13 21:48:39,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844236823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:39,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:39,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:48:39,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509740057] [2025-03-13 21:48:39,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:39,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:48:39,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:39,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:48:39,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:48:39,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:48:39,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 55 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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-03-13 21:48:39,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:39,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:48:39,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:40,914 INFO L124 PetriNetUnfolderBase]: 8292/12712 cut-off events. [2025-03-13 21:48:40,914 INFO L125 PetriNetUnfolderBase]: For 7074/7074 co-relation queries the response was YES. [2025-03-13 21:48:40,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30627 conditions, 12712 events. 8292/12712 cut-off events. For 7074/7074 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 81815 event pairs, 1465 based on Foata normal form. 684/13322 useless extension candidates. Maximal degree in co-relation 23128. Up to 6744 conditions per place. [2025-03-13 21:48:40,982 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 75 selfloop transitions, 5 changer transitions 2/91 dead transitions. [2025-03-13 21:48:40,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 492 flow [2025-03-13 21:48:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:48:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:48:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-03-13 21:48:40,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49666666666666665 [2025-03-13 21:48:40,983 INFO L175 Difference]: Start difference. First operand has 72 places, 55 transitions, 214 flow. Second operand 6 states and 149 transitions. [2025-03-13 21:48:40,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 492 flow [2025-03-13 21:48:41,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 91 transitions, 468 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-13 21:48:41,041 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 194 flow [2025-03-13 21:48:41,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2025-03-13 21:48:41,042 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2025-03-13 21:48:41,042 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 194 flow [2025-03-13 21:48:41,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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-03-13 21:48:41,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:41,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:41,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:48:41,042 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 2 more)] === [2025-03-13 21:48:41,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:41,043 INFO L85 PathProgramCache]: Analyzing trace with hash 178953623, now seen corresponding path program 1 times [2025-03-13 21:48:41,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:41,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084028873] [2025-03-13 21:48:41,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:41,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:41,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:48:41,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:48:41,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:41,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:48:41,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:41,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084028873] [2025-03-13 21:48:41,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084028873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:41,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:41,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:48:41,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427249928] [2025-03-13 21:48:41,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:41,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:48:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:41,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:48:41,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:48:41,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:48:41,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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-03-13 21:48:41,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:41,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:48:41,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:41,687 INFO L124 PetriNetUnfolderBase]: 5174/7693 cut-off events. [2025-03-13 21:48:41,687 INFO L125 PetriNetUnfolderBase]: For 5732/5732 co-relation queries the response was YES. [2025-03-13 21:48:41,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18856 conditions, 7693 events. 5174/7693 cut-off events. For 5732/5732 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 43818 event pairs, 908 based on Foata normal form. 372/8029 useless extension candidates. Maximal degree in co-relation 15382. Up to 4362 conditions per place. [2025-03-13 21:48:41,728 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 76 selfloop transitions, 5 changer transitions 1/91 dead transitions. [2025-03-13 21:48:41,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 484 flow [2025-03-13 21:48:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:48:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:48:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2025-03-13 21:48:41,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033333333333333 [2025-03-13 21:48:41,730 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 194 flow. Second operand 6 states and 151 transitions. [2025-03-13 21:48:41,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 484 flow [2025-03-13 21:48:41,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 458 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-03-13 21:48:41,735 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 184 flow [2025-03-13 21:48:41,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2025-03-13 21:48:41,736 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-03-13 21:48:41,737 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 184 flow [2025-03-13 21:48:41,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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-03-13 21:48:41,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:41,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:41,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:48:41,738 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 2 more)] === [2025-03-13 21:48:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1430441200, now seen corresponding path program 1 times [2025-03-13 21:48:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691770302] [2025-03-13 21:48:41,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:41,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 21:48:41,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:48:41,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:41,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:48:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691770302] [2025-03-13 21:48:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691770302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:41,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:41,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:48:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077041539] [2025-03-13 21:48:41,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:41,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:48:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:41,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:48:41,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:48:41,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:48:41,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:41,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:41,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:48:41,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:42,603 INFO L124 PetriNetUnfolderBase]: 7068/10133 cut-off events. [2025-03-13 21:48:42,603 INFO L125 PetriNetUnfolderBase]: For 7969/7969 co-relation queries the response was YES. [2025-03-13 21:48:42,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25949 conditions, 10133 events. 7068/10133 cut-off events. For 7969/7969 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 56042 event pairs, 1593 based on Foata normal form. 228/10313 useless extension candidates. Maximal degree in co-relation 25922. Up to 3692 conditions per place. [2025-03-13 21:48:42,663 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 96 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2025-03-13 21:48:42,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 116 transitions, 626 flow [2025-03-13 21:48:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:48:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:48:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-03-13 21:48:42,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5766666666666667 [2025-03-13 21:48:42,664 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 184 flow. Second operand 6 states and 173 transitions. [2025-03-13 21:48:42,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 116 transitions, 626 flow [2025-03-13 21:48:42,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 116 transitions, 597 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-13 21:48:42,669 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 259 flow [2025-03-13 21:48:42,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-03-13 21:48:42,670 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2025-03-13 21:48:42,670 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 259 flow [2025-03-13 21:48:42,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:42,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:42,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:42,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:48:42,671 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 2 more)] === [2025-03-13 21:48:42,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:42,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1517245342, now seen corresponding path program 2 times [2025-03-13 21:48:42,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:42,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-03-13 21:48:42,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:48:42,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:42,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:48:42,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 42 statements. [2025-03-13 21:48:42,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:48:42,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:48:42,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:42,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-03-13 21:48:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582901109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:42,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:42,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:48:42,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683914700] [2025-03-13 21:48:42,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:42,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:48:42,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:42,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:48:42,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:48:42,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-13 21:48:42,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:42,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:42,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-13 21:48:42,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:43,927 INFO L124 PetriNetUnfolderBase]: 11309/16101 cut-off events. [2025-03-13 21:48:43,927 INFO L125 PetriNetUnfolderBase]: For 21111/21111 co-relation queries the response was YES. [2025-03-13 21:48:43,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47076 conditions, 16101 events. 11309/16101 cut-off events. For 21111/21111 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 93886 event pairs, 1057 based on Foata normal form. 308/16401 useless extension candidates. Maximal degree in co-relation 47047. Up to 10690 conditions per place. [2025-03-13 21:48:43,994 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 136 selfloop transitions, 15 changer transitions 0/159 dead transitions. [2025-03-13 21:48:43,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 159 transitions, 919 flow [2025-03-13 21:48:43,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:48:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:48:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 242 transitions. [2025-03-13 21:48:43,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5377777777777778 [2025-03-13 21:48:43,995 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 259 flow. Second operand 9 states and 242 transitions. [2025-03-13 21:48:43,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 159 transitions, 919 flow [2025-03-13 21:48:44,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 159 transitions, 916 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:44,006 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 412 flow [2025-03-13 21:48:44,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=412, PETRI_PLACES=80, PETRI_TRANSITIONS=73} [2025-03-13 21:48:44,007 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2025-03-13 21:48:44,007 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 73 transitions, 412 flow [2025-03-13 21:48:44,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:44,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:44,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:44,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:48:44,007 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 2 more)] === [2025-03-13 21:48:44,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:44,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1398538068, now seen corresponding path program 3 times [2025-03-13 21:48:44,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:44,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943625680] [2025-03-13 21:48:44,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:48:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:44,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:48:44,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:48:44,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:48:44,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-13 21:48:44,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:44,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943625680] [2025-03-13 21:48:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943625680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:48:44,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260005951] [2025-03-13 21:48:44,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:48:44,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:48:44,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:48:44,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:48:44,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:48:44,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:48:44,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:48:44,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:48:44,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:44,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:48:44,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:48:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-13 21:48:44,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:48:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:48:44,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260005951] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:48:44,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:48:44,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5] total 15 [2025-03-13 21:48:44,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643021385] [2025-03-13 21:48:44,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:44,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:48:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:44,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:48:44,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:48:44,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-13 21:48:44,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 73 transitions, 412 flow. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:44,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:44,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-13 21:48:44,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:46,501 INFO L124 PetriNetUnfolderBase]: 16161/22047 cut-off events. [2025-03-13 21:48:46,501 INFO L125 PetriNetUnfolderBase]: For 39708/39711 co-relation queries the response was YES. [2025-03-13 21:48:46,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70460 conditions, 22047 events. 16161/22047 cut-off events. For 39708/39711 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 120989 event pairs, 1301 based on Foata normal form. 90/22085 useless extension candidates. Maximal degree in co-relation 70423. Up to 7404 conditions per place. [2025-03-13 21:48:46,644 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 198 selfloop transitions, 46 changer transitions 4/255 dead transitions. [2025-03-13 21:48:46,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 255 transitions, 1790 flow [2025-03-13 21:48:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:48:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:48:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 331 transitions. [2025-03-13 21:48:46,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5092307692307693 [2025-03-13 21:48:46,645 INFO L175 Difference]: Start difference. First operand has 80 places, 73 transitions, 412 flow. Second operand 13 states and 331 transitions. [2025-03-13 21:48:46,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 255 transitions, 1790 flow [2025-03-13 21:48:46,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 255 transitions, 1763 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:46,745 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 812 flow [2025-03-13 21:48:46,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=812, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2025-03-13 21:48:46,746 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 46 predicate places. [2025-03-13 21:48:46,746 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 812 flow [2025-03-13 21:48:46,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:46,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:46,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:46,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:48:46,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-13 21:48:46,947 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 2 more)] === [2025-03-13 21:48:46,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1314506332, now seen corresponding path program 1 times [2025-03-13 21:48:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:46,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565017852] [2025-03-13 21:48:46,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:48:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:46,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 21:48:46,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:48:46,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:48:46,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:48:47,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:47,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565017852] [2025-03-13 21:48:47,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565017852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:47,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:47,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:48:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028781802] [2025-03-13 21:48:47,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:47,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:48:47,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:47,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:48:47,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:48:47,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-13 21:48:47,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 812 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:47,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:47,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-13 21:48:47,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:49,779 INFO L124 PetriNetUnfolderBase]: 19338/27655 cut-off events. [2025-03-13 21:48:49,779 INFO L125 PetriNetUnfolderBase]: For 95515/95995 co-relation queries the response was YES. [2025-03-13 21:48:49,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99472 conditions, 27655 events. 19338/27655 cut-off events. For 95515/95995 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 170859 event pairs, 4341 based on Foata normal form. 1022/28597 useless extension candidates. Maximal degree in co-relation 99428. Up to 9694 conditions per place. [2025-03-13 21:48:50,092 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 259 selfloop transitions, 13 changer transitions 0/284 dead transitions. [2025-03-13 21:48:50,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 284 transitions, 2845 flow [2025-03-13 21:48:50,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:48:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:48:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-03-13 21:48:50,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-03-13 21:48:50,094 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 812 flow. Second operand 6 states and 177 transitions. [2025-03-13 21:48:50,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 284 transitions, 2845 flow [2025-03-13 21:48:50,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 284 transitions, 2721 flow, removed 62 selfloop flow, removed 0 redundant places. [2025-03-13 21:48:50,740 INFO L231 Difference]: Finished difference. Result has 106 places, 114 transitions, 875 flow [2025-03-13 21:48:50,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=875, PETRI_PLACES=106, PETRI_TRANSITIONS=114} [2025-03-13 21:48:50,741 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 55 predicate places. [2025-03-13 21:48:50,741 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 114 transitions, 875 flow [2025-03-13 21:48:50,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:50,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:50,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:50,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:48:50,741 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 2 more)] === [2025-03-13 21:48:50,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:50,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1791930926, now seen corresponding path program 2 times [2025-03-13 21:48:50,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:50,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235342851] [2025-03-13 21:48:50,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:48:50,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:50,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:48:50,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 42 statements. [2025-03-13 21:48:50,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:48:50,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:48:50,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:50,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235342851] [2025-03-13 21:48:50,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235342851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:50,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:50,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:48:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863614365] [2025-03-13 21:48:50,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:50,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:48:50,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:50,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:48:50,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:48:50,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-13 21:48:50,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 114 transitions, 875 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:50,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:50,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-13 21:48:50,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:48:55,502 INFO L124 PetriNetUnfolderBase]: 37642/51166 cut-off events. [2025-03-13 21:48:55,502 INFO L125 PetriNetUnfolderBase]: For 211840/212573 co-relation queries the response was YES. [2025-03-13 21:48:55,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211086 conditions, 51166 events. 37642/51166 cut-off events. For 211840/212573 co-relation queries the response was YES. Maximal size of possible extension queue 1735. Compared 313727 event pairs, 3970 based on Foata normal form. 1809/52879 useless extension candidates. Maximal degree in co-relation 211036. Up to 18345 conditions per place. [2025-03-13 21:48:56,041 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 301 selfloop transitions, 34 changer transitions 0/345 dead transitions. [2025-03-13 21:48:56,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 345 transitions, 3460 flow [2025-03-13 21:48:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:48:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:48:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2025-03-13 21:48:56,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2025-03-13 21:48:56,054 INFO L175 Difference]: Start difference. First operand has 106 places, 114 transitions, 875 flow. Second operand 7 states and 207 transitions. [2025-03-13 21:48:56,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 345 transitions, 3460 flow [2025-03-13 21:48:56,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 345 transitions, 3455 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:48:56,625 INFO L231 Difference]: Finished difference. Result has 115 places, 135 transitions, 1163 flow [2025-03-13 21:48:56,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1163, PETRI_PLACES=115, PETRI_TRANSITIONS=135} [2025-03-13 21:48:56,626 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 64 predicate places. [2025-03-13 21:48:56,626 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 135 transitions, 1163 flow [2025-03-13 21:48:56,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:56,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:48:56,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:48:56,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:48:56,626 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 2 more)] === [2025-03-13 21:48:56,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:48:56,626 INFO L85 PathProgramCache]: Analyzing trace with hash 833167086, now seen corresponding path program 3 times [2025-03-13 21:48:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:48:56,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601722686] [2025-03-13 21:48:56,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:48:56,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:48:56,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:48:56,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 42 statements. [2025-03-13 21:48:56,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:48:56,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:48:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:48:56,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:48:56,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601722686] [2025-03-13 21:48:56,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601722686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:48:56,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:48:56,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:48:56,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655446722] [2025-03-13 21:48:56,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:48:56,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:48:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:48:56,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:48:56,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:48:56,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-13 21:48:56,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 135 transitions, 1163 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:48:56,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:48:56,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-13 21:48:56,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:06,293 INFO L124 PetriNetUnfolderBase]: 70985/95741 cut-off events. [2025-03-13 21:49:06,294 INFO L125 PetriNetUnfolderBase]: For 527045/528194 co-relation queries the response was YES. [2025-03-13 21:49:07,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449165 conditions, 95741 events. 70985/95741 cut-off events. For 527045/528194 co-relation queries the response was YES. Maximal size of possible extension queue 3086. Compared 613483 event pairs, 3436 based on Foata normal form. 2228/97938 useless extension candidates. Maximal degree in co-relation 449111. Up to 30342 conditions per place. [2025-03-13 21:49:07,535 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 349 selfloop transitions, 48 changer transitions 0/407 dead transitions. [2025-03-13 21:49:07,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 407 transitions, 4475 flow [2025-03-13 21:49:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:49:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:49:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2025-03-13 21:49:07,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-03-13 21:49:07,536 INFO L175 Difference]: Start difference. First operand has 115 places, 135 transitions, 1163 flow. Second operand 6 states and 186 transitions. [2025-03-13 21:49:07,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 407 transitions, 4475 flow [2025-03-13 21:49:09,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 407 transitions, 4434 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:09,558 INFO L231 Difference]: Finished difference. Result has 123 places, 175 transitions, 1808 flow [2025-03-13 21:49:09,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1808, PETRI_PLACES=123, PETRI_TRANSITIONS=175} [2025-03-13 21:49:09,558 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 72 predicate places. [2025-03-13 21:49:09,558 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 175 transitions, 1808 flow [2025-03-13 21:49:09,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:09,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:09,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:09,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:49:09,558 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:49:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -631277128, now seen corresponding path program 4 times [2025-03-13 21:49:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020738020] [2025-03-13 21:49:09,559 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:09,570 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:49:09,586 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:49:09,587 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:09,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:49:09,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020738020] [2025-03-13 21:49:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020738020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100619302] [2025-03-13 21:49:09,918 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:09,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:09,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:09,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:09,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:49:09,984 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-13 21:49:10,016 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:49:10,016 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:10,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:10,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:49:10,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:49:10,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:49:10,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100619302] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:10,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:10,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5] total 14 [2025-03-13 21:49:10,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920102699] [2025-03-13 21:49:10,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:10,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:49:10,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:10,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:49:10,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:49:10,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-13 21:49:10,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 175 transitions, 1808 flow. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:10,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:10,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-13 21:49:10,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand