./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-04 02:24:24,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:24:24,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:24:24,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:24:24,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:24:24,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:24:24,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:24:24,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:24:24,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:24:24,370 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:24:24,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:24:24,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:24:24,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:24:24,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:24:24,370 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:24:24,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:24:24,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:24:24,370 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:24:24,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:24:24,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:24:24,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:24:24,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:24:24,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:24:24,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:24:24,371 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:24:24,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:24:24,371 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:24:24,371 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:24:24,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:24:24,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:24:24,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:24:24,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:24:24,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:24:24,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:24:24,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:24:24,372 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:24:24,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:24:24,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:24:24,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:24:24,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:24:24,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:24:24,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:24:24,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:24:24,372 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-04 02:24:24,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:24:24,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:24:24,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:24:24,614 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:24:24,615 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:24:24,616 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-04 02:24:25,760 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1249b216e/d0d29a20db2c4032a4b2df9f5293f625/FLAG51eb6985b [2025-03-04 02:24:25,955 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:24:25,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2025-03-04 02:24:25,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1249b216e/d0d29a20db2c4032a4b2df9f5293f625/FLAG51eb6985b [2025-03-04 02:24:25,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1249b216e/d0d29a20db2c4032a4b2df9f5293f625 [2025-03-04 02:24:25,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:24:25,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:24:25,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:24:25,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:24:25,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:24:25,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:24:25" (1/1) ... [2025-03-04 02:24:25,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720ae879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:25, skipping insertion in model container [2025-03-04 02:24:25,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:24:25" (1/1) ... [2025-03-04 02:24:26,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:24:26,135 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-04 02:24:26,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:24:26,154 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:24:26,176 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-04 02:24:26,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:24:26,189 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:24:26,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26 WrapperNode [2025-03-04 02:24:26,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:24:26,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:24:26,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:24:26,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:24:26,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,227 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 315 [2025-03-04 02:24:26,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:24:26,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:24:26,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:24:26,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:24:26,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,265 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-04 02:24:26,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:24:26,290 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:24:26,290 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:24:26,290 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:24:26,291 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (1/1) ... [2025-03-04 02:24:26,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:24:26,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:26,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:24:26,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:24:26,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:24:26,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:24:26,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:24:26,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:24:26,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:24:26,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:24:26,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:24:26,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:24:26,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:24:26,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:24:26,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:24:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 02:24:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 02:24:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:24:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:24:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:24:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:24:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:24:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:24:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:24:26,341 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:24:26,434 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:24:26,436 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:24:26,830 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:24:26,831 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:24:27,086 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:24:27,086 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:24:27,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:24:27 BoogieIcfgContainer [2025-03-04 02:24:27,087 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:24:27,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:24:27,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:24:27,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:24:27,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:24:25" (1/3) ... [2025-03-04 02:24:27,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f945ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:24:27, skipping insertion in model container [2025-03-04 02:24:27,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:24:26" (2/3) ... [2025-03-04 02:24:27,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f945ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:24:27, skipping insertion in model container [2025-03-04 02:24:27,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:24:27" (3/3) ... [2025-03-04 02:24:27,095 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2025-03-04 02:24:27,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:24:27,108 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-04 02:24:27,108 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:24:27,158 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 02:24:27,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 128 flow [2025-03-04 02:24:27,215 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2025-03-04 02:24:27,220 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:24:27,222 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-04 02:24:27,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 128 flow [2025-03-04 02:24:27,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 45 transitions, 114 flow [2025-03-04 02:24:27,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:24:27,243 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;@7d349d6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:24:27,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:24:27,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:24:27,259 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2025-03-04 02:24:27,259 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:24:27,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:27,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:27,260 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-04 02:24:27,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash 685516359, now seen corresponding path program 1 times [2025-03-04 02:24:27,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:27,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294363649] [2025-03-04 02:24:27,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:27,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:27,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:24:27,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:24:27,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:27,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:27,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:27,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294363649] [2025-03-04 02:24:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294363649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:27,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:24:27,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403570856] [2025-03-04 02:24:27,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:27,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:24:27,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:27,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:24:27,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:24:27,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-04 02:24:27,583 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-04 02:24:27,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:27,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-04 02:24:27,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:28,112 INFO L124 PetriNetUnfolderBase]: 3683/5094 cut-off events. [2025-03-04 02:24:28,112 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2025-03-04 02:24:28,125 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-04 02:24:28,150 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 53 selfloop transitions, 3 changer transitions 1/66 dead transitions. [2025-03-04 02:24:28,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 285 flow [2025-03-04 02:24:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:24:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:24:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-04 02:24:28,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2025-03-04 02:24:28,162 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 114 flow. Second operand 3 states and 97 transitions. [2025-03-04 02:24:28,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 285 flow [2025-03-04 02:24:28,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 259 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:24:28,175 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 117 flow [2025-03-04 02:24:28,177 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-04 02:24:28,178 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-03-04 02:24:28,178 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 117 flow [2025-03-04 02:24:28,179 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-04 02:24:28,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:28,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:28,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:24:28,179 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-04 02:24:28,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash -820236404, now seen corresponding path program 1 times [2025-03-04 02:24:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:28,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243794435] [2025-03-04 02:24:28,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:28,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:28,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 02:24:28,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:24:28,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:28,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:28,350 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-04 02:24:28,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243794435] [2025-03-04 02:24:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243794435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:28,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:28,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:24:28,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12961385] [2025-03-04 02:24:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:24:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:28,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:24:28,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:24:28,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-04 02:24:28,353 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-04 02:24:28,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:28,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-04 02:24:28,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:28,939 INFO L124 PetriNetUnfolderBase]: 4691/6608 cut-off events. [2025-03-04 02:24:28,939 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2025-03-04 02:24:28,950 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-04 02:24:28,974 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 61 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-04 02:24:28,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 307 flow [2025-03-04 02:24:28,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:24:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:24:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-03-04 02:24:28,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 02:24:28,977 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 117 flow. Second operand 3 states and 100 transitions. [2025-03-04 02:24:28,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 307 flow [2025-03-04 02:24:28,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:28,980 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 128 flow [2025-03-04 02:24:28,980 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-04 02:24:28,981 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-03-04 02:24:28,981 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 128 flow [2025-03-04 02:24:28,981 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-04 02:24:28,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:28,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:28,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:24:28,983 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-04 02:24:28,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash -195990480, now seen corresponding path program 1 times [2025-03-04 02:24:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:28,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581600592] [2025-03-04 02:24:28,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:28,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 02:24:29,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:24:29,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:29,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:29,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581600592] [2025-03-04 02:24:29,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581600592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:29,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:29,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:24:29,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647609962] [2025-03-04 02:24:29,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:29,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:24:29,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:29,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:24:29,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:24:29,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-04 02:24:29,105 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-04 02:24:29,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:29,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-04 02:24:29,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:29,637 INFO L124 PetriNetUnfolderBase]: 5825/8336 cut-off events. [2025-03-04 02:24:29,637 INFO L125 PetriNetUnfolderBase]: For 2259/2259 co-relation queries the response was YES. [2025-03-04 02:24:29,647 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-04 02:24:29,682 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 61 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-04 02:24:29,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 323 flow [2025-03-04 02:24:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:24:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:24:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-03-04 02:24:29,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-03-04 02:24:29,684 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 128 flow. Second operand 3 states and 98 transitions. [2025-03-04 02:24:29,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 323 flow [2025-03-04 02:24:29,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:29,686 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 140 flow [2025-03-04 02:24:29,687 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-04 02:24:29,687 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2025-03-04 02:24:29,687 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 140 flow [2025-03-04 02:24:29,687 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-04 02:24:29,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:29,688 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-04 02:24:29,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:24:29,688 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-04 02:24:29,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:29,689 INFO L85 PathProgramCache]: Analyzing trace with hash -311527695, now seen corresponding path program 1 times [2025-03-04 02:24:29,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:29,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496474757] [2025-03-04 02:24:29,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:29,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:29,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 02:24:29,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:24:29,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:29,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:29,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:29,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496474757] [2025-03-04 02:24:29,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496474757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:29,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:29,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:24:29,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60865328] [2025-03-04 02:24:29,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:29,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:24:29,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:29,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:24:29,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:24:29,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-04 02:24:29,869 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-04 02:24:29,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:29,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-04 02:24:29,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:30,667 INFO L124 PetriNetUnfolderBase]: 7724/11131 cut-off events. [2025-03-04 02:24:30,667 INFO L125 PetriNetUnfolderBase]: For 4122/4122 co-relation queries the response was YES. [2025-03-04 02:24:30,681 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-04 02:24:30,710 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 70 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2025-03-04 02:24:30,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 375 flow [2025-03-04 02:24:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:24:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:24:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-04 02:24:30,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 02:24:30,713 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 140 flow. Second operand 4 states and 120 transitions. [2025-03-04 02:24:30,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 375 flow [2025-03-04 02:24:30,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:30,715 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 158 flow [2025-03-04 02:24:30,715 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-04 02:24:30,717 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2025-03-04 02:24:30,717 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 158 flow [2025-03-04 02:24:30,717 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-04 02:24:30,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:30,717 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-04 02:24:30,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:24:30,718 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-04 02:24:30,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1759052763, now seen corresponding path program 1 times [2025-03-04 02:24:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:30,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551972384] [2025-03-04 02:24:30,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:30,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 02:24:30,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:24:30,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:30,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:24:30,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:30,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551972384] [2025-03-04 02:24:30,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551972384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:30,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:30,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:24:30,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289543706] [2025-03-04 02:24:30,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:30,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:24:30,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:30,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:24:30,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:24:30,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-04 02:24:30,877 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-04 02:24:30,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:30,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-04 02:24:30,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:31,651 INFO L124 PetriNetUnfolderBase]: 10320/15084 cut-off events. [2025-03-04 02:24:31,651 INFO L125 PetriNetUnfolderBase]: For 5630/5630 co-relation queries the response was YES. [2025-03-04 02:24:31,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33506 conditions, 15084 events. 10320/15084 cut-off events. For 5630/5630 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 93289 event pairs, 8685 based on Foata normal form. 335/15268 useless extension candidates. Maximal degree in co-relation 25637. Up to 10448 conditions per place. [2025-03-04 02:24:31,709 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 69 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2025-03-04 02:24:31,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 390 flow [2025-03-04 02:24:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:24:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:24:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-03-04 02:24:31,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-03-04 02:24:31,713 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 158 flow. Second operand 4 states and 118 transitions. [2025-03-04 02:24:31,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 390 flow [2025-03-04 02:24:31,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 386 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:31,715 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 177 flow [2025-03-04 02:24:31,715 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=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-04 02:24:31,716 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2025-03-04 02:24:31,716 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 177 flow [2025-03-04 02:24:31,716 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-04 02:24:31,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:31,716 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-04 02:24:31,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:24:31,716 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-04 02:24:31,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:31,719 INFO L85 PathProgramCache]: Analyzing trace with hash 585961973, now seen corresponding path program 1 times [2025-03-04 02:24:31,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:31,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125441383] [2025-03-04 02:24:31,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:31,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:31,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 02:24:31,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:24:31,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:31,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:32,000 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-04 02:24:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:32,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125441383] [2025-03-04 02:24:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125441383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:32,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:24:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47852076] [2025-03-04 02:24:32,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:32,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:24:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:32,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:24:32,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:24:32,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-04 02:24:32,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 177 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-04 02:24:32,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:32,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-04 02:24:32,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:33,630 INFO L124 PetriNetUnfolderBase]: 18964/27287 cut-off events. [2025-03-04 02:24:33,630 INFO L125 PetriNetUnfolderBase]: For 8840/8891 co-relation queries the response was YES. [2025-03-04 02:24:33,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60788 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 177821 event pairs, 8099 based on Foata normal form. 21/26020 useless extension candidates. Maximal degree in co-relation 46946. Up to 9991 conditions per place. [2025-03-04 02:24:33,737 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 109 selfloop transitions, 7 changer transitions 0/124 dead transitions. [2025-03-04 02:24:33,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 124 transitions, 614 flow [2025-03-04 02:24:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:24:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:24:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2025-03-04 02:24:33,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2025-03-04 02:24:33,739 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 177 flow. Second operand 6 states and 176 transitions. [2025-03-04 02:24:33,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 124 transitions, 614 flow [2025-03-04 02:24:33,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 124 transitions, 609 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:33,743 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 207 flow [2025-03-04 02:24:33,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-03-04 02:24:33,743 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-03-04 02:24:33,744 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 207 flow [2025-03-04 02:24:33,744 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-04 02:24:33,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:33,744 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-04 02:24:33,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:24:33,744 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-04 02:24:33,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1137195063, now seen corresponding path program 1 times [2025-03-04 02:24:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007506677] [2025-03-04 02:24:33,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:33,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 02:24:33,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:24:33,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:33,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:33,956 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-04 02:24:33,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:33,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007506677] [2025-03-04 02:24:33,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007506677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:33,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:24:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093214060] [2025-03-04 02:24:33,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:33,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:24:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:33,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:24:33,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:24:33,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-04 02:24:33,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 207 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-04 02:24:33,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:33,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-04 02:24:33,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:35,079 INFO L124 PetriNetUnfolderBase]: 15658/23022 cut-off events. [2025-03-04 02:24:35,079 INFO L125 PetriNetUnfolderBase]: For 10390/10402 co-relation queries the response was YES. [2025-03-04 02:24:35,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52899 conditions, 23022 events. 15658/23022 cut-off events. For 10390/10402 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 152136 event pairs, 11917 based on Foata normal form. 0/21860 useless extension candidates. Maximal degree in co-relation 38126. Up to 18334 conditions per place. [2025-03-04 02:24:35,205 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 42 selfloop transitions, 4 changer transitions 34/88 dead transitions. [2025-03-04 02:24:35,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 446 flow [2025-03-04 02:24:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:24:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:24:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-04 02:24:35,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-04 02:24:35,206 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 207 flow. Second operand 6 states and 145 transitions. [2025-03-04 02:24:35,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 446 flow [2025-03-04 02:24:35,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 440 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 02:24:35,215 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 201 flow [2025-03-04 02:24:35,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2025-03-04 02:24:35,216 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2025-03-04 02:24:35,217 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 201 flow [2025-03-04 02:24:35,217 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-04 02:24:35,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:35,217 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-04 02:24:35,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:24:35,218 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-04 02:24:35,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:35,218 INFO L85 PathProgramCache]: Analyzing trace with hash -583007327, now seen corresponding path program 1 times [2025-03-04 02:24:35,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:35,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098139669] [2025-03-04 02:24:35,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:35,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:35,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:24:35,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:24:35,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:35,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:24:35,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:35,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098139669] [2025-03-04 02:24:35,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098139669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:35,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:35,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:24:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407970726] [2025-03-04 02:24:35,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:35,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:24:35,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:35,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:24:35,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:24:35,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-04 02:24:35,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 54 transitions, 201 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-04 02:24:35,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:35,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-04 02:24:35,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:36,187 INFO L124 PetriNetUnfolderBase]: 8292/12712 cut-off events. [2025-03-04 02:24:36,187 INFO L125 PetriNetUnfolderBase]: For 6354/6354 co-relation queries the response was YES. [2025-03-04 02:24:36,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30380 conditions, 12712 events. 8292/12712 cut-off events. For 6354/6354 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 81138 event pairs, 1465 based on Foata normal form. 684/13322 useless extension candidates. Maximal degree in co-relation 22885. Up to 6744 conditions per place. [2025-03-04 02:24:36,256 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 75 selfloop transitions, 5 changer transitions 1/90 dead transitions. [2025-03-04 02:24:36,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 90 transitions, 473 flow [2025-03-04 02:24:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:24:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:24:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-03-04 02:24:36,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49666666666666665 [2025-03-04 02:24:36,257 INFO L175 Difference]: Start difference. First operand has 70 places, 54 transitions, 201 flow. Second operand 6 states and 149 transitions. [2025-03-04 02:24:36,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 90 transitions, 473 flow [2025-03-04 02:24:36,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 453 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-04 02:24:36,350 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 190 flow [2025-03-04 02:24:36,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2025-03-04 02:24:36,351 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-03-04 02:24:36,351 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 190 flow [2025-03-04 02:24:36,351 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-04 02:24:36,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:36,351 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-04 02:24:36,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:24:36,351 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-04 02:24:36,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:36,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2022438789, now seen corresponding path program 1 times [2025-03-04 02:24:36,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:36,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160693007] [2025-03-04 02:24:36,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:36,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:36,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:24:36,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:24:36,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:36,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:36,551 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-04 02:24:36,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:36,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160693007] [2025-03-04 02:24:36,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160693007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:36,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:36,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:24:36,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137794534] [2025-03-04 02:24:36,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:36,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:24:36,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:36,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:24:36,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:24:36,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-04 02:24:36,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 190 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-04 02:24:36,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:36,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-04 02:24:36,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:37,165 INFO L124 PetriNetUnfolderBase]: 5174/7693 cut-off events. [2025-03-04 02:24:37,166 INFO L125 PetriNetUnfolderBase]: For 5724/5724 co-relation queries the response was YES. [2025-03-04 02:24:37,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18851 conditions, 7693 events. 5174/7693 cut-off events. For 5724/5724 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 43788 event pairs, 908 based on Foata normal form. 372/8029 useless extension candidates. Maximal degree in co-relation 15380. Up to 4362 conditions per place. [2025-03-04 02:24:37,201 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 76 selfloop transitions, 5 changer transitions 1/91 dead transitions. [2025-03-04 02:24:37,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 480 flow [2025-03-04 02:24:37,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:24:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:24:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2025-03-04 02:24:37,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033333333333333 [2025-03-04 02:24:37,203 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 190 flow. Second operand 6 states and 151 transitions. [2025-03-04 02:24:37,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 480 flow [2025-03-04 02:24:37,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 456 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 02:24:37,208 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 182 flow [2025-03-04 02:24:37,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=176, 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=182, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2025-03-04 02:24:37,209 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-03-04 02:24:37,209 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 182 flow [2025-03-04 02:24:37,209 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-04 02:24:37,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:37,210 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-04 02:24:37,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:24:37,210 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-04 02:24:37,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:37,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1234297168, now seen corresponding path program 1 times [2025-03-04 02:24:37,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:37,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738950883] [2025-03-04 02:24:37,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:37,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:37,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:24:37,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:24:37,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:37,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:37,381 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-04 02:24:37,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:37,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738950883] [2025-03-04 02:24:37,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738950883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:37,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:37,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:24:37,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531314230] [2025-03-04 02:24:37,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:37,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:24:37,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:37,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:24:37,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:24:37,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-04 02:24:37,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 182 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-04 02:24:37,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:37,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-04 02:24:37,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:38,263 INFO L124 PetriNetUnfolderBase]: 7068/10133 cut-off events. [2025-03-04 02:24:38,263 INFO L125 PetriNetUnfolderBase]: For 7966/7966 co-relation queries the response was YES. [2025-03-04 02:24:38,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25948 conditions, 10133 events. 7068/10133 cut-off events. For 7966/7966 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 56017 event pairs, 1593 based on Foata normal form. 228/10313 useless extension candidates. Maximal degree in co-relation 25921. Up to 3692 conditions per place. [2025-03-04 02:24:38,322 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 96 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2025-03-04 02:24:38,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 116 transitions, 624 flow [2025-03-04 02:24:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:24:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:24:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-03-04 02:24:38,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5766666666666667 [2025-03-04 02:24:38,323 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 182 flow. Second operand 6 states and 173 transitions. [2025-03-04 02:24:38,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 116 transitions, 624 flow [2025-03-04 02:24:38,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 116 transitions, 597 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 02:24:38,329 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 259 flow [2025-03-04 02:24:38,329 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-04 02:24:38,329 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2025-03-04 02:24:38,329 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 259 flow [2025-03-04 02:24:38,330 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-04 02:24:38,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:38,330 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-04 02:24:38,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:24:38,330 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-04 02:24:38,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1517245342, now seen corresponding path program 2 times [2025-03-04 02:24:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:38,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162238029] [2025-03-04 02:24:38,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:38,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:38,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:24:38,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 42 statements. [2025-03-04 02:24:38,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:24:38,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:38,607 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-04 02:24:38,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:38,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162238029] [2025-03-04 02:24:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162238029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:38,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:38,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:24:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199525577] [2025-03-04 02:24:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:38,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:24:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:38,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:24:38,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:24:38,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-04 02:24:38,614 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-04 02:24:38,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:38,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-04 02:24:38,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:39,760 INFO L124 PetriNetUnfolderBase]: 11309/16101 cut-off events. [2025-03-04 02:24:39,760 INFO L125 PetriNetUnfolderBase]: For 21111/21111 co-relation queries the response was YES. [2025-03-04 02:24:39,795 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 93779 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-04 02:24:39,840 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 136 selfloop transitions, 15 changer transitions 0/159 dead transitions. [2025-03-04 02:24:39,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 159 transitions, 919 flow [2025-03-04 02:24:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:24:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:24:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 242 transitions. [2025-03-04 02:24:39,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5377777777777778 [2025-03-04 02:24:39,841 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 259 flow. Second operand 9 states and 242 transitions. [2025-03-04 02:24:39,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 159 transitions, 919 flow [2025-03-04 02:24:39,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 159 transitions, 916 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:39,855 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 412 flow [2025-03-04 02:24:39,855 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-04 02:24:39,856 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2025-03-04 02:24:39,856 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 73 transitions, 412 flow [2025-03-04 02:24:39,856 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-04 02:24:39,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:39,856 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-04 02:24:39,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:24:39,856 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-04 02:24:39,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1398538068, now seen corresponding path program 3 times [2025-03-04 02:24:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:39,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004588406] [2025-03-04 02:24:39,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:24:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:39,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:24:39,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:24:39,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:24:39,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 02:24:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:40,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004588406] [2025-03-04 02:24:40,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004588406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:40,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:40,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:24:40,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915832168] [2025-03-04 02:24:40,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:40,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:24:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:40,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:24:40,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:24:40,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-03-04 02:24:40,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 73 transitions, 412 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-04 02:24:40,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:40,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-03-04 02:24:40,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:41,477 INFO L124 PetriNetUnfolderBase]: 15441/21158 cut-off events. [2025-03-04 02:24:41,478 INFO L125 PetriNetUnfolderBase]: For 44553/44641 co-relation queries the response was YES. [2025-03-04 02:24:41,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70204 conditions, 21158 events. 15441/21158 cut-off events. For 44553/44641 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 121912 event pairs, 1912 based on Foata normal form. 273/21354 useless extension candidates. Maximal degree in co-relation 70167. Up to 7788 conditions per place. [2025-03-04 02:24:41,595 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 135 selfloop transitions, 32 changer transitions 0/176 dead transitions. [2025-03-04 02:24:41,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 176 transitions, 1427 flow [2025-03-04 02:24:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:24:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:24:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-03-04 02:24:41,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.612 [2025-03-04 02:24:41,596 INFO L175 Difference]: Start difference. First operand has 80 places, 73 transitions, 412 flow. Second operand 5 states and 153 transitions. [2025-03-04 02:24:41,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 176 transitions, 1427 flow [2025-03-04 02:24:41,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 176 transitions, 1400 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:41,688 INFO L231 Difference]: Finished difference. Result has 87 places, 100 transitions, 793 flow [2025-03-04 02:24:41,688 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=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=793, PETRI_PLACES=87, PETRI_TRANSITIONS=100} [2025-03-04 02:24:41,689 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2025-03-04 02:24:41,689 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 100 transitions, 793 flow [2025-03-04 02:24:41,689 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-04 02:24:41,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:41,689 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-04 02:24:41,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:24:41,689 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-04 02:24:41,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1069479332, now seen corresponding path program 4 times [2025-03-04 02:24:41,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:41,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474312300] [2025-03-04 02:24:41,690 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:24:41,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:41,697 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:24:41,709 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:24:41,709 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:24:41,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:24:41,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:41,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474312300] [2025-03-04 02:24:41,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474312300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:41,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795361687] [2025-03-04 02:24:41,823 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:24:41,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:41,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:41,826 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-04 02:24:41,831 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-04 02:24:41,890 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:24:41,920 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:24:41,921 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:24:41,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:41,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:24:41,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:24:42,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:24:42,321 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-04 02:24:42,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795361687] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:42,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:24:42,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 7] total 17 [2025-03-04 02:24:42,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028784287] [2025-03-04 02:24:42,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:42,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:24:42,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:42,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:24:42,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:24:42,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-03-04 02:24:42,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 100 transitions, 793 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-04 02:24:42,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:42,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-03-04 02:24:42,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:45,157 INFO L124 PetriNetUnfolderBase]: 28607/39243 cut-off events. [2025-03-04 02:24:45,158 INFO L125 PetriNetUnfolderBase]: For 133593/135053 co-relation queries the response was YES. [2025-03-04 02:24:45,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145819 conditions, 39243 events. 28607/39243 cut-off events. For 133593/135053 co-relation queries the response was YES. Maximal size of possible extension queue 1559. Compared 240519 event pairs, 969 based on Foata normal form. 430/39521 useless extension candidates. Maximal degree in co-relation 145779. Up to 13051 conditions per place. [2025-03-04 02:24:45,508 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 247 selfloop transitions, 104 changer transitions 0/358 dead transitions. [2025-03-04 02:24:45,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 358 transitions, 3108 flow [2025-03-04 02:24:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:24:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:24:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 366 transitions. [2025-03-04 02:24:45,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563076923076923 [2025-03-04 02:24:45,509 INFO L175 Difference]: Start difference. First operand has 87 places, 100 transitions, 793 flow. Second operand 13 states and 366 transitions. [2025-03-04 02:24:45,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 358 transitions, 3108 flow [2025-03-04 02:24:45,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 358 transitions, 3108 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:24:45,762 INFO L231 Difference]: Finished difference. Result has 107 places, 180 transitions, 2026 flow [2025-03-04 02:24:45,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2026, PETRI_PLACES=107, PETRI_TRANSITIONS=180} [2025-03-04 02:24:45,763 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 56 predicate places. [2025-03-04 02:24:45,763 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 180 transitions, 2026 flow [2025-03-04 02:24:45,763 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-04 02:24:45,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:45,763 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-04 02:24:45,770 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-04 02:24:45,963 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,SelfDestructingSolverStorable12 [2025-03-04 02:24:45,964 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-04 02:24:45,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1711098292, now seen corresponding path program 1 times [2025-03-04 02:24:45,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:45,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959599546] [2025-03-04 02:24:45,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:24:45,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:45,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:24:45,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:24:45,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:24:45,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 02:24:46,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:46,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959599546] [2025-03-04 02:24:46,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959599546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:46,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:46,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:24:46,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715926229] [2025-03-04 02:24:46,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:46,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:24:46,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:46,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:24:46,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:24:46,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-04 02:24:46,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 180 transitions, 2026 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:46,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:46,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-04 02:24:46,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:49,894 INFO L124 PetriNetUnfolderBase]: 28712/41412 cut-off events. [2025-03-04 02:24:49,894 INFO L125 PetriNetUnfolderBase]: For 259051/261390 co-relation queries the response was YES. [2025-03-04 02:24:50,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185347 conditions, 41412 events. 28712/41412 cut-off events. For 259051/261390 co-relation queries the response was YES. Maximal size of possible extension queue 1820. Compared 283164 event pairs, 8399 based on Foata normal form. 1907/42475 useless extension candidates. Maximal degree in co-relation 185297. Up to 25616 conditions per place. [2025-03-04 02:24:50,339 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 370 selfloop transitions, 11 changer transitions 0/403 dead transitions. [2025-03-04 02:24:50,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 403 transitions, 5583 flow [2025-03-04 02:24:50,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:24:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:24:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2025-03-04 02:24:50,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5085714285714286 [2025-03-04 02:24:50,341 INFO L175 Difference]: Start difference. First operand has 107 places, 180 transitions, 2026 flow. Second operand 7 states and 178 transitions. [2025-03-04 02:24:50,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 403 transitions, 5583 flow [2025-03-04 02:24:51,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 403 transitions, 5444 flow, removed 62 selfloop flow, removed 1 redundant places. [2025-03-04 02:24:51,538 INFO L231 Difference]: Finished difference. Result has 115 places, 185 transitions, 2048 flow [2025-03-04 02:24:51,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2048, PETRI_PLACES=115, PETRI_TRANSITIONS=185} [2025-03-04 02:24:51,538 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 64 predicate places. [2025-03-04 02:24:51,538 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 185 transitions, 2048 flow [2025-03-04 02:24:51,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:51,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:51,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:24:51,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:24:51,539 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-04 02:24:51,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1864552124, now seen corresponding path program 5 times [2025-03-04 02:24:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:51,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583560872] [2025-03-04 02:24:51,539 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:24:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:51,547 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:24:51,556 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:24:51,557 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:51,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:51,692 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-04 02:24:51,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:51,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583560872] [2025-03-04 02:24:51,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583560872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:51,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:24:51,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:24:51,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500352305] [2025-03-04 02:24:51,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:51,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:24:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:51,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:24:51,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:24:51,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-04 02:24:51,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 185 transitions, 2048 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:51,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:51,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-04 02:24:51,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:24:55,654 INFO L124 PetriNetUnfolderBase]: 26484/37926 cut-off events. [2025-03-04 02:24:55,654 INFO L125 PetriNetUnfolderBase]: For 246741/248596 co-relation queries the response was YES. [2025-03-04 02:24:55,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177914 conditions, 37926 events. 26484/37926 cut-off events. For 246741/248596 co-relation queries the response was YES. Maximal size of possible extension queue 1480. Compared 252104 event pairs, 4198 based on Foata normal form. 573/37726 useless extension candidates. Maximal degree in co-relation 177860. Up to 19344 conditions per place. [2025-03-04 02:24:56,273 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 161 selfloop transitions, 64 changer transitions 0/246 dead transitions. [2025-03-04 02:24:56,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 246 transitions, 2948 flow [2025-03-04 02:24:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:24:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:24:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2025-03-04 02:24:56,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:24:56,274 INFO L175 Difference]: Start difference. First operand has 115 places, 185 transitions, 2048 flow. Second operand 7 states and 175 transitions. [2025-03-04 02:24:56,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 246 transitions, 2948 flow [2025-03-04 02:24:57,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 246 transitions, 2930 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 02:24:57,021 INFO L231 Difference]: Finished difference. Result has 119 places, 187 transitions, 2328 flow [2025-03-04 02:24:57,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2328, PETRI_PLACES=119, PETRI_TRANSITIONS=187} [2025-03-04 02:24:57,022 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 68 predicate places. [2025-03-04 02:24:57,022 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 187 transitions, 2328 flow [2025-03-04 02:24:57,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:24:57,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:24:57,022 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-04 02:24:57,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:24:57,022 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-04 02:24:57,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:24:57,023 INFO L85 PathProgramCache]: Analyzing trace with hash -295292308, now seen corresponding path program 2 times [2025-03-04 02:24:57,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:24:57,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517207068] [2025-03-04 02:24:57,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:57,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:24:57,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:24:57,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:24:57,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:57,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:57,168 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-04 02:24:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:24:57,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517207068] [2025-03-04 02:24:57,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517207068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:24:57,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529076145] [2025-03-04 02:24:57,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:24:57,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:24:57,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:24:57,171 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-04 02:24:57,172 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-04 02:24:57,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:24:57,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:24:57,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:24:57,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:24:57,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:24:57,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:24:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:24:57,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:24:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529076145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:24:57,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:24:57,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 02:24:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626533475] [2025-03-04 02:24:57,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:24:57,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:24:57,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:24:57,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:24:57,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:24:57,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-03-04 02:24:57,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 187 transitions, 2328 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-04 02:24:57,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:24:57,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-03-04 02:24:57,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:04,639 INFO L124 PetriNetUnfolderBase]: 48490/69470 cut-off events. [2025-03-04 02:25:04,640 INFO L125 PetriNetUnfolderBase]: For 519209/523304 co-relation queries the response was YES. [2025-03-04 02:25:05,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335605 conditions, 69470 events. 48490/69470 cut-off events. For 519209/523304 co-relation queries the response was YES. Maximal size of possible extension queue 2303. Compared 485053 event pairs, 8702 based on Foata normal form. 1896/70251 useless extension candidates. Maximal degree in co-relation 335549. Up to 23857 conditions per place. [2025-03-04 02:25:05,484 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 477 selfloop transitions, 17 changer transitions 0/515 dead transitions. [2025-03-04 02:25:05,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 515 transitions, 7713 flow [2025-03-04 02:25:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:25:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:25:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-03-04 02:25:05,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-03-04 02:25:05,485 INFO L175 Difference]: Start difference. First operand has 119 places, 187 transitions, 2328 flow. Second operand 6 states and 177 transitions. [2025-03-04 02:25:05,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 515 transitions, 7713 flow [2025-03-04 02:25:07,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 515 transitions, 7528 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-04 02:25:07,433 INFO L231 Difference]: Finished difference. Result has 123 places, 195 transitions, 2382 flow [2025-03-04 02:25:07,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2263, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2382, PETRI_PLACES=123, PETRI_TRANSITIONS=195} [2025-03-04 02:25:07,433 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 72 predicate places. [2025-03-04 02:25:07,434 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 195 transitions, 2382 flow [2025-03-04 02:25:07,434 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-04 02:25:07,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:07,434 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, 1, 1, 1] [2025-03-04 02:25:07,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:25:07,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:25:07,635 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 02:25:07,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:07,635 INFO L85 PathProgramCache]: Analyzing trace with hash 49637401, now seen corresponding path program 1 times [2025-03-04 02:25:07,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:07,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648754568] [2025-03-04 02:25:07,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:07,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 02:25:07,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 02:25:07,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:07,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:09,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:09,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648754568] [2025-03-04 02:25:09,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648754568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:09,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792277015] [2025-03-04 02:25:09,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:09,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:09,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:09,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:09,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:25:09,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 02:25:09,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 02:25:09,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:09,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:09,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 02:25:09,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:09,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 02:25:09,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 02:25:09,564 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 02:25:09,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 02:25:09,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 02:25:09,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:25:09,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 02:25:09,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 02:25:10,305 INFO L349 Elim1Store]: treesize reduction 12, result has 73.3 percent of original size [2025-03-04 02:25:10,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 46 [2025-03-04 02:25:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:10,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:11,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:11,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 113 [2025-03-04 02:25:11,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:11,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2258 treesize of output 2190 [2025-03-04 02:25:11,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:11,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1138 treesize of output 1210 [2025-03-04 02:25:11,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:11,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 994 treesize of output 922