./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-commit-1.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 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:33:27,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:33:27,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:33:27,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:33:27,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:33:27,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:33:27,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:33:27,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:33:27,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:33:27,194 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:33:27,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:33:27,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:33:27,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:33:27,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:33:27,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:33:27,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:33:27,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:33:27,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:33:27,198 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 -> 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e [2025-03-08 17:33:27,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:33:27,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:33:27,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:33:27,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:33:27,441 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:33:27,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-03-08 17:33:28,615 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2485e1a/37d421d1896e4c7a8e3ef764402d44aa/FLAGe8e2f7eda [2025-03-08 17:33:28,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:33:28,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-03-08 17:33:28,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2485e1a/37d421d1896e4c7a8e3ef764402d44aa/FLAGe8e2f7eda [2025-03-08 17:33:29,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2485e1a/37d421d1896e4c7a8e3ef764402d44aa [2025-03-08 17:33:29,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:33:29,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:33:29,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:33:29,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:33:29,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:33:29,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ede6a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29, skipping insertion in model container [2025-03-08 17:33:29,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:33:29,311 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-commit-1.wvr.c[4643,4656] [2025-03-08 17:33:29,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:33:29,323 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:33:29,345 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-commit-1.wvr.c[4643,4656] [2025-03-08 17:33:29,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:33:29,359 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:33:29,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29 WrapperNode [2025-03-08 17:33:29,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:33:29,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:33:29,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:33:29,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:33:29,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,391 INFO L138 Inliner]: procedures = 24, calls = 53, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 325 [2025-03-08 17:33:29,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:33:29,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:33:29,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:33:29,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:33:29,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,426 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-08 17:33:29,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:33:29,438 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:33:29,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:33:29,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:33:29,439 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (1/1) ... [2025-03-08 17:33:29,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:33:29,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:29,462 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-08 17:33:29,464 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-08 17:33:29,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:33:29,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:33:29,481 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:33:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:33:29,481 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:33:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:33:29,481 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:33:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:33:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:33:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:33:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:33:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:33:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:33:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:33:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:33:29,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:33:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:33:29,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:33:29,483 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:33:29,561 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:33:29,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:33:29,961 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:33:29,962 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:33:30,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:33:30,211 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:33:30,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:30 BoogieIcfgContainer [2025-03-08 17:33:30,211 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:33:30,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:33:30,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:33:30,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:33:30,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:33:29" (1/3) ... [2025-03-08 17:33:30,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56515b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:30, skipping insertion in model container [2025-03-08 17:33:30,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:29" (2/3) ... [2025-03-08 17:33:30,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56515b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:30, skipping insertion in model container [2025-03-08 17:33:30,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:30" (3/3) ... [2025-03-08 17:33:30,220 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2025-03-08 17:33:30,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:33:30,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-1.wvr.c that has 4 procedures, 40 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 17:33:30,233 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:33:30,280 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:33:30,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 117 flow [2025-03-08 17:33:30,334 INFO L124 PetriNetUnfolderBase]: 9/45 cut-off events. [2025-03-08 17:33:30,337 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:33:30,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 9/45 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-03-08 17:33:30,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 48 transitions, 117 flow [2025-03-08 17:33:30,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 106 flow [2025-03-08 17:33:30,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:33:30,363 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;@33ca6ad8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:33:30,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:33:30,379 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:33:30,380 INFO L124 PetriNetUnfolderBase]: 9/43 cut-off events. [2025-03-08 17:33:30,380 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:33:30,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:30,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:30,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:30,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:30,385 INFO L85 PathProgramCache]: Analyzing trace with hash -569557458, now seen corresponding path program 1 times [2025-03-08 17:33:30,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:30,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955248261] [2025-03-08 17:33:30,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:30,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:30,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:33:30,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:33:30,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:30,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:30,625 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-08 17:33:30,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:30,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955248261] [2025-03-08 17:33:30,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955248261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:30,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:30,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:33:30,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705298565] [2025-03-08 17:33:30,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:30,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:33:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:30,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:33:30,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:33:30,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:30,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-08 17:33:30,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:30,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:30,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:31,112 INFO L124 PetriNetUnfolderBase]: 2548/3637 cut-off events. [2025-03-08 17:33:31,112 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2025-03-08 17:33:31,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7470 conditions, 3637 events. 2548/3637 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16654 event pairs, 2146 based on Foata normal form. 0/3229 useless extension candidates. Maximal degree in co-relation 7063. Up to 3626 conditions per place. [2025-03-08 17:33:31,132 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 37 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2025-03-08 17:33:31,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 174 flow [2025-03-08 17:33:31,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:33:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 17:33:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2025-03-08 17:33:31,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-08 17:33:31,142 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 106 flow. Second operand 2 states and 54 transitions. [2025-03-08 17:33:31,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 174 flow [2025-03-08 17:33:31,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:33:31,149 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 88 flow [2025-03-08 17:33:31,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2025-03-08 17:33:31,154 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2025-03-08 17:33:31,154 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 88 flow [2025-03-08 17:33:31,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-08 17:33:31,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:31,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:31,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:33:31,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:31,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:31,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1361167108, now seen corresponding path program 1 times [2025-03-08 17:33:31,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:31,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280525520] [2025-03-08 17:33:31,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:31,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:31,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:33:31,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:33:31,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:31,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:31,390 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-08 17:33:31,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:31,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280525520] [2025-03-08 17:33:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280525520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:31,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:31,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:33:31,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278053056] [2025-03-08 17:33:31,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:31,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:31,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:31,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:31,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:31,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:31,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-08 17:33:31,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:31,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:31,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:31,798 INFO L124 PetriNetUnfolderBase]: 3499/4990 cut-off events. [2025-03-08 17:33:31,799 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-08 17:33:31,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10072 conditions, 4990 events. 3499/4990 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24953 event pairs, 876 based on Foata normal form. 1/4374 useless extension candidates. Maximal degree in co-relation 10069. Up to 3852 conditions per place. [2025-03-08 17:33:31,822 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 56 selfloop transitions, 4 changer transitions 1/65 dead transitions. [2025-03-08 17:33:31,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 263 flow [2025-03-08 17:33:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-08 17:33:31,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2025-03-08 17:33:31,824 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 88 flow. Second operand 3 states and 83 transitions. [2025-03-08 17:33:31,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 263 flow [2025-03-08 17:33:31,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:33:31,826 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 114 flow [2025-03-08 17:33:31,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2025-03-08 17:33:31,827 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2025-03-08 17:33:31,828 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 114 flow [2025-03-08 17:33:31,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-08 17:33:31,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:31,830 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:31,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:33:31,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:31,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2012511443, now seen corresponding path program 1 times [2025-03-08 17:33:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:31,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219268177] [2025-03-08 17:33:31,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:31,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:31,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:33:31,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:33:31,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:31,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:31,970 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-08 17:33:31,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:31,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219268177] [2025-03-08 17:33:31,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219268177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:31,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:31,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:33:31,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568840677] [2025-03-08 17:33:31,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:31,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:31,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:31,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:31,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:31,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:31,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 17:33:31,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:31,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:31,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:32,312 INFO L124 PetriNetUnfolderBase]: 4090/5894 cut-off events. [2025-03-08 17:33:32,313 INFO L125 PetriNetUnfolderBase]: For 545/545 co-relation queries the response was YES. [2025-03-08 17:33:32,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12635 conditions, 5894 events. 4090/5894 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 29483 event pairs, 1812 based on Foata normal form. 158/5255 useless extension candidates. Maximal degree in co-relation 12630. Up to 3358 conditions per place. [2025-03-08 17:33:32,337 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 62 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-08 17:33:32,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 68 transitions, 298 flow [2025-03-08 17:33:32,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-08 17:33:32,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-08 17:33:32,340 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 114 flow. Second operand 3 states and 84 transitions. [2025-03-08 17:33:32,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 68 transitions, 298 flow [2025-03-08 17:33:32,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 295 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:32,342 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 118 flow [2025-03-08 17:33:32,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-03-08 17:33:32,344 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2025-03-08 17:33:32,344 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 118 flow [2025-03-08 17:33:32,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 17:33:32,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:32,344 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:32,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:33:32,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:32,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:32,345 INFO L85 PathProgramCache]: Analyzing trace with hash -700640505, now seen corresponding path program 1 times [2025-03-08 17:33:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:32,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928537494] [2025-03-08 17:33:32,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:32,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:32,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:33:32,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:33:32,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:32,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:32,464 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-08 17:33:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:32,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928537494] [2025-03-08 17:33:32,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928537494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:32,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:32,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:33:32,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889600361] [2025-03-08 17:33:32,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:32,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:32,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:32,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:32,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:32,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:32,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 17:33:32,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:32,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:32,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:32,829 INFO L124 PetriNetUnfolderBase]: 3703/5358 cut-off events. [2025-03-08 17:33:32,829 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2025-03-08 17:33:32,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11720 conditions, 5358 events. 3703/5358 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 25987 event pairs, 1373 based on Foata normal form. 94/4783 useless extension candidates. Maximal degree in co-relation 11714. Up to 3376 conditions per place. [2025-03-08 17:33:32,851 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 57 selfloop transitions, 2 changer transitions 5/68 dead transitions. [2025-03-08 17:33:32,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 68 transitions, 301 flow [2025-03-08 17:33:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-08 17:33:32,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-03-08 17:33:32,854 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 118 flow. Second operand 3 states and 86 transitions. [2025-03-08 17:33:32,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 68 transitions, 301 flow [2025-03-08 17:33:32,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:32,857 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 124 flow [2025-03-08 17:33:32,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-03-08 17:33:32,857 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-03-08 17:33:32,858 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 124 flow [2025-03-08 17:33:32,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 17:33:32,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:32,858 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:32,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:33:32,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:32,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1078075590, now seen corresponding path program 1 times [2025-03-08 17:33:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481932092] [2025-03-08 17:33:32,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:32,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:33:32,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:33:32,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:32,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:32,963 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-08 17:33:32,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481932092] [2025-03-08 17:33:32,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481932092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:32,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:32,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:33:32,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021417192] [2025-03-08 17:33:32,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:32,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:32,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:32,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:32,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:32,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:32,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-08 17:33:32,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:32,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:32,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:33,201 INFO L124 PetriNetUnfolderBase]: 2561/3734 cut-off events. [2025-03-08 17:33:33,201 INFO L125 PetriNetUnfolderBase]: For 801/801 co-relation queries the response was YES. [2025-03-08 17:33:33,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8250 conditions, 3734 events. 2561/3734 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16265 event pairs, 1346 based on Foata normal form. 62/3266 useless extension candidates. Maximal degree in co-relation 8243. Up to 2767 conditions per place. [2025-03-08 17:33:33,211 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 48 selfloop transitions, 2 changer transitions 7/61 dead transitions. [2025-03-08 17:33:33,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 275 flow [2025-03-08 17:33:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-08 17:33:33,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-03-08 17:33:33,212 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 124 flow. Second operand 3 states and 76 transitions. [2025-03-08 17:33:33,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 275 flow [2025-03-08 17:33:33,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:33,213 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 134 flow [2025-03-08 17:33:33,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2025-03-08 17:33:33,214 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2025-03-08 17:33:33,214 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 134 flow [2025-03-08 17:33:33,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-08 17:33:33,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:33,214 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:33,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:33:33,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:33,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash -914143491, now seen corresponding path program 1 times [2025-03-08 17:33:33,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510137268] [2025-03-08 17:33:33,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:33,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 17:33:33,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 17:33:33,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:33,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:33,380 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-08 17:33:33,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:33,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510137268] [2025-03-08 17:33:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510137268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:33,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:33,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:33:33,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190045647] [2025-03-08 17:33:33,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:33,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:33:33,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:33,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:33:33,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:33:33,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:33,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-08 17:33:33,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:33,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:33,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:33,647 INFO L124 PetriNetUnfolderBase]: 3171/4702 cut-off events. [2025-03-08 17:33:33,647 INFO L125 PetriNetUnfolderBase]: For 773/773 co-relation queries the response was YES. [2025-03-08 17:33:33,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10434 conditions, 4702 events. 3171/4702 cut-off events. For 773/773 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 22201 event pairs, 2856 based on Foata normal form. 56/4042 useless extension candidates. Maximal degree in co-relation 10426. Up to 3723 conditions per place. [2025-03-08 17:33:33,658 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 40 selfloop transitions, 2 changer transitions 26/72 dead transitions. [2025-03-08 17:33:33,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 330 flow [2025-03-08 17:33:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:33:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:33:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-08 17:33:33,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.484375 [2025-03-08 17:33:33,660 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 134 flow. Second operand 4 states and 93 transitions. [2025-03-08 17:33:33,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 330 flow [2025-03-08 17:33:33,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:33,661 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 146 flow [2025-03-08 17:33:33,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2025-03-08 17:33:33,661 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2025-03-08 17:33:33,662 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 146 flow [2025-03-08 17:33:33,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-08 17:33:33,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:33,662 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:33,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:33:33,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:33,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:33,662 INFO L85 PathProgramCache]: Analyzing trace with hash -56169424, now seen corresponding path program 1 times [2025-03-08 17:33:33,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:33,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222053761] [2025-03-08 17:33:33,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:33,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:33,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 17:33:33,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 17:33:33,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:33,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:33,782 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-08 17:33:33,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:33,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222053761] [2025-03-08 17:33:33,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222053761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:33,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:33,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:33:33,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801299369] [2025-03-08 17:33:33,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:33,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:33:33,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:33,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:33:33,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:33:33,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:33,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:33:33,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:33,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:33,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:34,138 INFO L124 PetriNetUnfolderBase]: 3337/4963 cut-off events. [2025-03-08 17:33:34,139 INFO L125 PetriNetUnfolderBase]: For 924/924 co-relation queries the response was YES. [2025-03-08 17:33:34,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11113 conditions, 4963 events. 3337/4963 cut-off events. For 924/924 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 23831 event pairs, 3018 based on Foata normal form. 14/4234 useless extension candidates. Maximal degree in co-relation 11103. Up to 3721 conditions per place. [2025-03-08 17:33:34,159 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 39 selfloop transitions, 4 changer transitions 32/79 dead transitions. [2025-03-08 17:33:34,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 382 flow [2025-03-08 17:33:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:33:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:33:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-08 17:33:34,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2025-03-08 17:33:34,160 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 146 flow. Second operand 5 states and 107 transitions. [2025-03-08 17:33:34,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 382 flow [2025-03-08 17:33:34,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 374 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 17:33:34,162 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 166 flow [2025-03-08 17:33:34,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-03-08 17:33:34,162 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2025-03-08 17:33:34,162 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 166 flow [2025-03-08 17:33:34,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:33:34,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:34,164 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:34,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:33:34,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:34,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2075639658, now seen corresponding path program 1 times [2025-03-08 17:33:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:34,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730772170] [2025-03-08 17:33:34,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:34,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 17:33:34,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 17:33:34,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:34,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:33:34,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730772170] [2025-03-08 17:33:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730772170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:34,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:33:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695289066] [2025-03-08 17:33:34,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:34,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:33:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:34,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:33:34,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:33:34,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:34,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-08 17:33:34,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:34,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:34,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:34,592 INFO L124 PetriNetUnfolderBase]: 3297/4894 cut-off events. [2025-03-08 17:33:34,593 INFO L125 PetriNetUnfolderBase]: For 807/807 co-relation queries the response was YES. [2025-03-08 17:33:34,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10872 conditions, 4894 events. 3297/4894 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 23373 event pairs, 2984 based on Foata normal form. 10/4168 useless extension candidates. Maximal degree in co-relation 10860. Up to 3719 conditions per place. [2025-03-08 17:33:34,608 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 38 selfloop transitions, 6 changer transitions 24/72 dead transitions. [2025-03-08 17:33:34,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 368 flow [2025-03-08 17:33:34,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:33:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:33:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-03-08 17:33:34,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-08 17:33:34,609 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 166 flow. Second operand 5 states and 100 transitions. [2025-03-08 17:33:34,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 368 flow [2025-03-08 17:33:34,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 348 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-08 17:33:34,611 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 176 flow [2025-03-08 17:33:34,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-03-08 17:33:34,612 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2025-03-08 17:33:34,612 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 176 flow [2025-03-08 17:33:34,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-08 17:33:34,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:34,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:34,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:33:34,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:34,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1139471787, now seen corresponding path program 1 times [2025-03-08 17:33:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364346404] [2025-03-08 17:33:34,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:34,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 17:33:34,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:33:34,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:34,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:33:34,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:34,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364346404] [2025-03-08 17:33:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364346404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:34,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095992594] [2025-03-08 17:33:34,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:34,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:34,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:34,784 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-08 17:33:34,786 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-08 17:33:34,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 17:33:34,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:33:34,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:34,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:34,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:33:34,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:33:34,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:33:34,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095992594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:34,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:33:34,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 17:33:34,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095561171] [2025-03-08 17:33:34,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:34,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:33:34,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:34,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:33:34,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:33:34,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:34,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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-08 17:33:34,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:34,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:34,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:35,386 INFO L124 PetriNetUnfolderBase]: 5255/7615 cut-off events. [2025-03-08 17:33:35,386 INFO L125 PetriNetUnfolderBase]: For 2329/2329 co-relation queries the response was YES. [2025-03-08 17:33:35,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17555 conditions, 7615 events. 5255/7615 cut-off events. For 2329/2329 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 35160 event pairs, 2749 based on Foata normal form. 156/6710 useless extension candidates. Maximal degree in co-relation 17543. Up to 2981 conditions per place. [2025-03-08 17:33:35,409 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 85 selfloop transitions, 9 changer transitions 0/98 dead transitions. [2025-03-08 17:33:35,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 508 flow [2025-03-08 17:33:35,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:33:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:33:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-03-08 17:33:35,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-03-08 17:33:35,411 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 176 flow. Second operand 4 states and 115 transitions. [2025-03-08 17:33:35,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 508 flow [2025-03-08 17:33:35,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 494 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-08 17:33:35,413 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 225 flow [2025-03-08 17:33:35,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-03-08 17:33:35,414 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2025-03-08 17:33:35,414 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 225 flow [2025-03-08 17:33:35,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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-08 17:33:35,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:35,414 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:35,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 17:33:35,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:35,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:35,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:35,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1792165292, now seen corresponding path program 1 times [2025-03-08 17:33:35,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:35,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496360016] [2025-03-08 17:33:35,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:35,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 17:33:35,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:33:35,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:35,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:33:35,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:35,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496360016] [2025-03-08 17:33:35,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496360016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:35,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145988826] [2025-03-08 17:33:35,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:35,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:35,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:35,816 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-08 17:33:35,818 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-08 17:33:35,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 17:33:35,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 17:33:35,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:35,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:35,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 17:33:35,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:33:35,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:33:36,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145988826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:36,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:36,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-08 17:33:36,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147506143] [2025-03-08 17:33:36,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:36,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:33:36,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:36,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:33:36,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:33:36,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:36,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 225 flow. Second operand has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 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-08 17:33:36,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:36,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:36,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:36,739 INFO L124 PetriNetUnfolderBase]: 6007/8805 cut-off events. [2025-03-08 17:33:36,739 INFO L125 PetriNetUnfolderBase]: For 4182/4182 co-relation queries the response was YES. [2025-03-08 17:33:36,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21971 conditions, 8805 events. 6007/8805 cut-off events. For 4182/4182 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 42804 event pairs, 5125 based on Foata normal form. 2/7537 useless extension candidates. Maximal degree in co-relation 21958. Up to 7601 conditions per place. [2025-03-08 17:33:36,771 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 48 selfloop transitions, 3 changer transitions 43/98 dead transitions. [2025-03-08 17:33:36,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 549 flow [2025-03-08 17:33:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:33:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:33:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-03-08 17:33:36,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-03-08 17:33:36,772 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 225 flow. Second operand 6 states and 123 transitions. [2025-03-08 17:33:36,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 549 flow [2025-03-08 17:33:36,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 541 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-08 17:33:36,780 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 239 flow [2025-03-08 17:33:36,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2025-03-08 17:33:36,780 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2025-03-08 17:33:36,780 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 239 flow [2025-03-08 17:33:36,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 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-08 17:33:36,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:36,781 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:36,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 17:33:36,981 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,SelfDestructingSolverStorable9 [2025-03-08 17:33:36,981 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:36,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash 95118911, now seen corresponding path program 2 times [2025-03-08 17:33:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:36,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173142268] [2025-03-08 17:33:36,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:33:36,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:37,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-08 17:33:37,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 41 of 45 statements. [2025-03-08 17:33:37,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:33:37,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 17:33:37,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:37,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173142268] [2025-03-08 17:33:37,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173142268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:37,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:37,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:33:37,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178901557] [2025-03-08 17:33:37,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:37,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:33:37,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:37,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:33:37,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:33:37,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:37,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 239 flow. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 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-08 17:33:37,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:37,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:37,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:38,620 INFO L124 PetriNetUnfolderBase]: 6147/8901 cut-off events. [2025-03-08 17:33:38,621 INFO L125 PetriNetUnfolderBase]: For 4579/4579 co-relation queries the response was YES. [2025-03-08 17:33:38,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22447 conditions, 8901 events. 6147/8901 cut-off events. For 4579/4579 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 41538 event pairs, 2206 based on Foata normal form. 1/7638 useless extension candidates. Maximal degree in co-relation 22430. Up to 6518 conditions per place. [2025-03-08 17:33:38,643 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 100 selfloop transitions, 15 changer transitions 18/137 dead transitions. [2025-03-08 17:33:38,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 137 transitions, 731 flow [2025-03-08 17:33:38,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:33:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 17:33:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2025-03-08 17:33:38,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40208333333333335 [2025-03-08 17:33:38,648 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 239 flow. Second operand 10 states and 193 transitions. [2025-03-08 17:33:38,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 137 transitions, 731 flow [2025-03-08 17:33:38,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 717 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-08 17:33:38,653 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 349 flow [2025-03-08 17:33:38,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=349, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-03-08 17:33:38,654 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2025-03-08 17:33:38,654 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 349 flow [2025-03-08 17:33:38,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 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-08 17:33:38,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:38,654 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:38,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:33:38,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:38,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash 526799844, now seen corresponding path program 3 times [2025-03-08 17:33:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:38,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348443239] [2025-03-08 17:33:38,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:33:38,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:38,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 2 equivalence classes. [2025-03-08 17:33:38,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 17:33:38,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:33:38,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 17:33:38,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:38,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348443239] [2025-03-08 17:33:38,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348443239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:38,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486687325] [2025-03-08 17:33:38,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:33:38,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:38,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:38,832 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-08 17:33:38,833 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-08 17:33:38,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 2 equivalence classes. [2025-03-08 17:33:38,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 17:33:38,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:33:38,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:38,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 17:33:38,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:33:39,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:33:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486687325] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:39,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:39,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2025-03-08 17:33:39,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364369752] [2025-03-08 17:33:39,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:39,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 17:33:39,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:39,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 17:33:39,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:33:39,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:39,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 349 flow. Second operand has 20 states, 20 states have (on average 13.0) internal successors, (260), 20 states have internal predecessors, (260), 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-08 17:33:39,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:39,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:39,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:40,941 INFO L124 PetriNetUnfolderBase]: 11421/17200 cut-off events. [2025-03-08 17:33:40,941 INFO L125 PetriNetUnfolderBase]: For 16077/16077 co-relation queries the response was YES. [2025-03-08 17:33:40,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43986 conditions, 17200 events. 11421/17200 cut-off events. For 16077/16077 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 96619 event pairs, 7994 based on Foata normal form. 909/15550 useless extension candidates. Maximal degree in co-relation 43967. Up to 8883 conditions per place. [2025-03-08 17:33:40,990 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 112 selfloop transitions, 13 changer transitions 167/296 dead transitions. [2025-03-08 17:33:40,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 296 transitions, 1868 flow [2025-03-08 17:33:40,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 17:33:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-08 17:33:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 399 transitions. [2025-03-08 17:33:40,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36141304347826086 [2025-03-08 17:33:40,992 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 349 flow. Second operand 23 states and 399 transitions. [2025-03-08 17:33:40,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 296 transitions, 1868 flow [2025-03-08 17:33:41,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 296 transitions, 1772 flow, removed 43 selfloop flow, removed 2 redundant places. [2025-03-08 17:33:41,006 INFO L231 Difference]: Finished difference. Result has 112 places, 74 transitions, 473 flow [2025-03-08 17:33:41,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=473, PETRI_PLACES=112, PETRI_TRANSITIONS=74} [2025-03-08 17:33:41,007 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 67 predicate places. [2025-03-08 17:33:41,007 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 74 transitions, 473 flow [2025-03-08 17:33:41,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 13.0) internal successors, (260), 20 states have internal predecessors, (260), 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-08 17:33:41,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:41,007 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:41,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:33:41,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:41,208 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:41,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1368710796, now seen corresponding path program 4 times [2025-03-08 17:33:41,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:41,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445523835] [2025-03-08 17:33:41,208 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:33:41,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:41,221 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-03-08 17:33:41,236 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 17:33:41,237 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:33:41,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 17:33:41,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:41,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445523835] [2025-03-08 17:33:41,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445523835] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:41,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704783469] [2025-03-08 17:33:41,436 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:33:41,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:41,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:41,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:33:41,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:33:41,510 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-03-08 17:33:41,545 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 17:33:41,545 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:33:41,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:41,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 17:33:41,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 17:33:41,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 17:33:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704783469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:41,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-08 17:33:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217419045] [2025-03-08 17:33:41,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:41,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 17:33:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:41,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 17:33:41,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-08 17:33:41,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:41,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 74 transitions, 473 flow. Second operand has 18 states, 18 states have (on average 10.944444444444445) internal successors, (197), 18 states have internal predecessors, (197), 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-08 17:33:41,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:41,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:41,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:42,547 INFO L124 PetriNetUnfolderBase]: 6905/10111 cut-off events. [2025-03-08 17:33:42,547 INFO L125 PetriNetUnfolderBase]: For 14538/14538 co-relation queries the response was YES. [2025-03-08 17:33:42,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28330 conditions, 10111 events. 6905/10111 cut-off events. For 14538/14538 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 49996 event pairs, 5712 based on Foata normal form. 2/8640 useless extension candidates. Maximal degree in co-relation 28294. Up to 8887 conditions per place. [2025-03-08 17:33:42,586 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 60 selfloop transitions, 4 changer transitions 51/119 dead transitions. [2025-03-08 17:33:42,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 119 transitions, 833 flow [2025-03-08 17:33:42,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:33:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:33:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2025-03-08 17:33:42,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3776041666666667 [2025-03-08 17:33:42,587 INFO L175 Difference]: Start difference. First operand has 112 places, 74 transitions, 473 flow. Second operand 8 states and 145 transitions. [2025-03-08 17:33:42,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 119 transitions, 833 flow [2025-03-08 17:33:42,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 119 transitions, 764 flow, removed 28 selfloop flow, removed 13 redundant places. [2025-03-08 17:33:42,608 INFO L231 Difference]: Finished difference. Result has 98 places, 68 transitions, 367 flow [2025-03-08 17:33:42,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=367, PETRI_PLACES=98, PETRI_TRANSITIONS=68} [2025-03-08 17:33:42,609 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2025-03-08 17:33:42,609 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 68 transitions, 367 flow [2025-03-08 17:33:42,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.944444444444445) internal successors, (197), 18 states have internal predecessors, (197), 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-08 17:33:42,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:42,609 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:42,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 17:33:42,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:42,814 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:42,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash 536495547, now seen corresponding path program 5 times [2025-03-08 17:33:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:42,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064804645] [2025-03-08 17:33:42,814 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:33:42,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:42,825 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 3 equivalence classes. [2025-03-08 17:33:42,837 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 17:33:42,837 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 17:33:42,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:33:42,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:42,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064804645] [2025-03-08 17:33:42,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064804645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:42,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737640553] [2025-03-08 17:33:42,938 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:33:42,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:42,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:42,940 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:33:42,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 17:33:43,006 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 3 equivalence classes. [2025-03-08 17:33:43,048 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 17:33:43,048 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 17:33:43,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:43,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 17:33:43,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:33:43,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:33:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737640553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:43,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:43,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-08 17:33:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539722622] [2025-03-08 17:33:43,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:43,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:33:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:43,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:33:43,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:33:43,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:43,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 68 transitions, 367 flow. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 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-08 17:33:43,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:43,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:43,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:44,262 INFO L124 PetriNetUnfolderBase]: 9349/13754 cut-off events. [2025-03-08 17:33:44,262 INFO L125 PetriNetUnfolderBase]: For 13006/13006 co-relation queries the response was YES. [2025-03-08 17:33:44,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35860 conditions, 13754 events. 9349/13754 cut-off events. For 13006/13006 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 70957 event pairs, 6573 based on Foata normal form. 418/12083 useless extension candidates. Maximal degree in co-relation 35830. Up to 7734 conditions per place. [2025-03-08 17:33:44,306 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 106 selfloop transitions, 10 changer transitions 25/145 dead transitions. [2025-03-08 17:33:44,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 145 transitions, 919 flow [2025-03-08 17:33:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:33:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:33:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2025-03-08 17:33:44,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36553030303030304 [2025-03-08 17:33:44,307 INFO L175 Difference]: Start difference. First operand has 98 places, 68 transitions, 367 flow. Second operand 11 states and 193 transitions. [2025-03-08 17:33:44,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 145 transitions, 919 flow [2025-03-08 17:33:44,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 145 transitions, 885 flow, removed 13 selfloop flow, removed 10 redundant places. [2025-03-08 17:33:44,320 INFO L231 Difference]: Finished difference. Result has 93 places, 72 transitions, 403 flow [2025-03-08 17:33:44,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=403, PETRI_PLACES=93, PETRI_TRANSITIONS=72} [2025-03-08 17:33:44,320 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2025-03-08 17:33:44,320 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 72 transitions, 403 flow [2025-03-08 17:33:44,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 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-08 17:33:44,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:44,321 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:44,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 17:33:44,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 17:33:44,521 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:44,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1829105327, now seen corresponding path program 6 times [2025-03-08 17:33:44,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:44,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382912026] [2025-03-08 17:33:44,522 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:33:44,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:44,532 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 3 equivalence classes. [2025-03-08 17:33:44,539 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 45 of 51 statements. [2025-03-08 17:33:44,539 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:33:44,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 17:33:44,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:44,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382912026] [2025-03-08 17:33:44,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382912026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:44,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:44,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:33:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646986836] [2025-03-08 17:33:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:44,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:33:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:44,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:33:44,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:33:44,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:44,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 72 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-08 17:33:44,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:44,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:44,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:46,395 INFO L124 PetriNetUnfolderBase]: 16058/23328 cut-off events. [2025-03-08 17:33:46,395 INFO L125 PetriNetUnfolderBase]: For 28897/28897 co-relation queries the response was YES. [2025-03-08 17:33:46,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63940 conditions, 23328 events. 16058/23328 cut-off events. For 28897/28897 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 121408 event pairs, 7934 based on Foata normal form. 364/20360 useless extension candidates. Maximal degree in co-relation 63913. Up to 10563 conditions per place. [2025-03-08 17:33:46,517 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 118 selfloop transitions, 7 changer transitions 3/132 dead transitions. [2025-03-08 17:33:46,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 132 transitions, 934 flow [2025-03-08 17:33:46,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:33:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:33:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-03-08 17:33:46,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-03-08 17:33:46,518 INFO L175 Difference]: Start difference. First operand has 93 places, 72 transitions, 403 flow. Second operand 4 states and 115 transitions. [2025-03-08 17:33:46,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 132 transitions, 934 flow [2025-03-08 17:33:46,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 132 transitions, 918 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-08 17:33:46,537 INFO L231 Difference]: Finished difference. Result has 93 places, 71 transitions, 410 flow [2025-03-08 17:33:46,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=410, PETRI_PLACES=93, PETRI_TRANSITIONS=71} [2025-03-08 17:33:46,537 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2025-03-08 17:33:46,537 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 71 transitions, 410 flow [2025-03-08 17:33:46,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-08 17:33:46,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:46,538 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:46,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:33:46,538 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 1 more)] === [2025-03-08 17:33:46,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:46,538 INFO L85 PathProgramCache]: Analyzing trace with hash -273208050, now seen corresponding path program 7 times [2025-03-08 17:33:46,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:46,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980587167] [2025-03-08 17:33:46,539 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:33:46,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:46,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 17:33:46,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 17:33:46,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:46,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 17:33:46,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:46,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980587167] [2025-03-08 17:33:46,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980587167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:46,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:46,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:33:46,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697077959] [2025-03-08 17:33:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:46,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:33:46,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:46,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:33:46,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:33:46,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:46,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 71 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:33:46,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:46,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:46,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:46,928 INFO L124 PetriNetUnfolderBase]: 2344/3635 cut-off events. [2025-03-08 17:33:46,929 INFO L125 PetriNetUnfolderBase]: For 3534/3534 co-relation queries the response was YES. [2025-03-08 17:33:46,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8753 conditions, 3635 events. 2344/3635 cut-off events. For 3534/3534 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 15693 event pairs, 2305 based on Foata normal form. 164/3161 useless extension candidates. Maximal degree in co-relation 8724. Up to 3577 conditions per place. [2025-03-08 17:33:46,940 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 51 selfloop transitions, 5 changer transitions 2/62 dead transitions. [2025-03-08 17:33:46,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 62 transitions, 434 flow [2025-03-08 17:33:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:33:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:33:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-08 17:33:46,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2025-03-08 17:33:46,941 INFO L175 Difference]: Start difference. First operand has 93 places, 71 transitions, 410 flow. Second operand 4 states and 71 transitions. [2025-03-08 17:33:46,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 62 transitions, 434 flow [2025-03-08 17:33:46,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 62 transitions, 365 flow, removed 8 selfloop flow, removed 15 redundant places. [2025-03-08 17:33:46,946 INFO L231 Difference]: Finished difference. Result has 78 places, 57 transitions, 249 flow [2025-03-08 17:33:46,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=78, PETRI_TRANSITIONS=57} [2025-03-08 17:33:46,947 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2025-03-08 17:33:46,947 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 249 flow [2025-03-08 17:33:46,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:33:46,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:46,947 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:46,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 17:33:46,947 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 1 more)] === [2025-03-08 17:33:46,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1110724623, now seen corresponding path program 8 times [2025-03-08 17:33:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:46,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910285077] [2025-03-08 17:33:46,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:33:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:46,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-08 17:33:46,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 17:33:46,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:33:46,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 17:33:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:47,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910285077] [2025-03-08 17:33:47,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910285077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:47,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943457248] [2025-03-08 17:33:47,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:33:47,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:47,126 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:33:47,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 17:33:47,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-08 17:33:47,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 17:33:47,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:33:47,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:47,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 17:33:47,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 17:33:47,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 17:33:47,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943457248] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:47,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:47,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-03-08 17:33:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121745941] [2025-03-08 17:33:47,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:47,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 17:33:47,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:47,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 17:33:47,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-08 17:33:47,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:47,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 57 transitions, 249 flow. Second operand has 22 states, 22 states have (on average 13.590909090909092) internal successors, (299), 22 states have internal predecessors, (299), 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-08 17:33:47,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:47,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:47,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:48,531 INFO L124 PetriNetUnfolderBase]: 3986/6225 cut-off events. [2025-03-08 17:33:48,531 INFO L125 PetriNetUnfolderBase]: For 876/876 co-relation queries the response was YES. [2025-03-08 17:33:48,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13510 conditions, 6225 events. 3986/6225 cut-off events. For 876/876 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 30446 event pairs, 2412 based on Foata normal form. 56/5198 useless extension candidates. Maximal degree in co-relation 13491. Up to 2403 conditions per place. [2025-03-08 17:33:48,551 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 52 selfloop transitions, 9 changer transitions 88/153 dead transitions. [2025-03-08 17:33:48,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 153 transitions, 839 flow [2025-03-08 17:33:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 17:33:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-08 17:33:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 249 transitions. [2025-03-08 17:33:48,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3458333333333333 [2025-03-08 17:33:48,555 INFO L175 Difference]: Start difference. First operand has 78 places, 57 transitions, 249 flow. Second operand 15 states and 249 transitions. [2025-03-08 17:33:48,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 153 transitions, 839 flow [2025-03-08 17:33:48,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 153 transitions, 821 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-08 17:33:48,561 INFO L231 Difference]: Finished difference. Result has 95 places, 58 transitions, 277 flow [2025-03-08 17:33:48,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=277, PETRI_PLACES=95, PETRI_TRANSITIONS=58} [2025-03-08 17:33:48,562 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 50 predicate places. [2025-03-08 17:33:48,562 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 58 transitions, 277 flow [2025-03-08 17:33:48,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.590909090909092) internal successors, (299), 22 states have internal predecessors, (299), 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-08 17:33:48,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:48,563 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:48,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 17:33:48,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 17:33:48,764 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:48,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash -989279983, now seen corresponding path program 9 times [2025-03-08 17:33:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466875483] [2025-03-08 17:33:48,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:33:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:48,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 3 equivalence classes. [2025-03-08 17:33:48,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 17:33:48,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 17:33:48,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 17:33:49,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:49,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466875483] [2025-03-08 17:33:49,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466875483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:49,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108015232] [2025-03-08 17:33:49,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:33:49,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:49,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:49,122 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:33:49,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 17:33:49,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 3 equivalence classes. [2025-03-08 17:33:49,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 17:33:49,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 17:33:49,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:49,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 17:33:49,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 17:33:49,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 17:33:49,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108015232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:49,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:49,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-08 17:33:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092013396] [2025-03-08 17:33:49,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:49,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 17:33:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:49,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 17:33:49,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2025-03-08 17:33:49,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2025-03-08 17:33:49,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 58 transitions, 277 flow. Second operand has 24 states, 24 states have (on average 11.25) internal successors, (270), 24 states have internal predecessors, (270), 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-08 17:33:49,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:49,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2025-03-08 17:33:49,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:50,064 INFO L124 PetriNetUnfolderBase]: 3900/6068 cut-off events. [2025-03-08 17:33:50,064 INFO L125 PetriNetUnfolderBase]: For 1172/1172 co-relation queries the response was YES. [2025-03-08 17:33:50,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13380 conditions, 6068 events. 3900/6068 cut-off events. For 1172/1172 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 29560 event pairs, 3330 based on Foata normal form. 2/5014 useless extension candidates. Maximal degree in co-relation 13356. Up to 3622 conditions per place. [2025-03-08 17:33:50,080 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 50 selfloop transitions, 5 changer transitions 69/128 dead transitions. [2025-03-08 17:33:50,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 128 transitions, 782 flow [2025-03-08 17:33:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:33:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 17:33:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2025-03-08 17:33:50,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-03-08 17:33:50,082 INFO L175 Difference]: Start difference. First operand has 95 places, 58 transitions, 277 flow. Second operand 10 states and 176 transitions. [2025-03-08 17:33:50,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 128 transitions, 782 flow [2025-03-08 17:33:50,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 128 transitions, 734 flow, removed 12 selfloop flow, removed 12 redundant places. [2025-03-08 17:33:50,085 INFO L231 Difference]: Finished difference. Result has 92 places, 59 transitions, 279 flow [2025-03-08 17:33:50,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=279, PETRI_PLACES=92, PETRI_TRANSITIONS=59} [2025-03-08 17:33:50,085 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2025-03-08 17:33:50,085 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 59 transitions, 279 flow [2025-03-08 17:33:50,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.25) internal successors, (270), 24 states have internal predecessors, (270), 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-08 17:33:50,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:50,086 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:50,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 17:33:50,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:50,286 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:50,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash 942066982, now seen corresponding path program 10 times [2025-03-08 17:33:50,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:50,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061031346] [2025-03-08 17:33:50,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:33:50,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:50,297 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-03-08 17:33:50,351 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 17:33:50,352 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:33:50,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:53,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061031346] [2025-03-08 17:33:53,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061031346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584556281] [2025-03-08 17:33:53,824 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:33:53,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:53,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:53,825 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:33:53,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 17:33:53,902 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-03-08 17:33:53,957 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 17:33:53,958 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:33:53,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:53,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 143 conjuncts are in the unsatisfiable core [2025-03-08 17:33:53,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:54,002 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-08 17:33:54,176 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 15 treesize of output 1 [2025-03-08 17:33:54,244 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 17:33:54,244 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-08 17:33:54,308 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-08 17:33:54,378 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-08 17:33:54,443 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-08 17:33:54,521 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 17:33:54,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-08 17:33:54,597 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-08 17:33:54,677 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 15 treesize of output 1 [2025-03-08 17:33:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:59,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:34:11,805 INFO L349 Elim1Store]: treesize reduction 75, result has 45.3 percent of original size [2025-03-08 17:34:11,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 362 treesize of output 292 [2025-03-08 17:34:12,782 INFO L349 Elim1Store]: treesize reduction 72, result has 46.7 percent of original size [2025-03-08 17:34:12,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 365 treesize of output 297 [2025-03-08 17:34:13,520 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-08 17:34:13,520 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 343 treesize of output 264 [2025-03-08 17:34:14,059 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-08 17:34:14,059 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 302 treesize of output 239 [2025-03-08 17:34:14,572 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-08 17:34:14,572 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 265 [2025-03-08 17:34:14,902 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-08 17:34:14,902 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 343 treesize of output 264 [2025-03-08 17:34:15,228 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-08 17:34:15,229 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 265 [2025-03-08 17:34:15,739 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-08 17:34:15,739 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 265 [2025-03-08 17:34:16,099 INFO L349 Elim1Store]: treesize reduction 40, result has 53.5 percent of original size [2025-03-08 17:34:16,100 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 265 [2025-03-08 17:34:41,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:34:41,402 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 325 treesize of output 193 [2025-03-08 17:34:41,441 INFO L349 Elim1Store]: treesize reduction 58, result has 34.8 percent of original size [2025-03-08 17:34:41,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1622 treesize of output 1488 [2025-03-08 17:34:41,568 INFO L349 Elim1Store]: treesize reduction 68, result has 67.8 percent of original size [2025-03-08 17:34:41,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 712 treesize of output 764 [2025-03-08 17:34:41,590 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:41,591 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:41,593 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:41,594 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:41,596 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:41,597 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:41,598 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:41,600 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:41,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:34:41,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 622 treesize of output 596 [2025-03-08 17:34:48,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:34:48,467 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 325 treesize of output 193 [2025-03-08 17:34:48,509 INFO L349 Elim1Store]: treesize reduction 58, result has 34.8 percent of original size [2025-03-08 17:34:48,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1622 treesize of output 1488 [2025-03-08 17:34:48,626 INFO L349 Elim1Store]: treesize reduction 68, result has 67.6 percent of original size [2025-03-08 17:34:48,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 712 treesize of output 763 [2025-03-08 17:34:48,646 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:48,649 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:48,651 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:48,652 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:48,653 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:48,654 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:48,655 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:48,658 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:48,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:34:48,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 622 treesize of output 595 [2025-03-08 17:34:54,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:34:54,430 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 329 treesize of output 197 [2025-03-08 17:34:54,470 INFO L349 Elim1Store]: treesize reduction 58, result has 34.8 percent of original size [2025-03-08 17:34:54,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 810 treesize of output 758 [2025-03-08 17:34:54,486 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:54,486 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:54,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:34:54,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:34:54,593 INFO L349 Elim1Store]: treesize reduction 68, result has 70.6 percent of original size [2025-03-08 17:34:54,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 30 case distinctions, treesize of input 728 treesize of output 706 [2025-03-08 17:34:54,616 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:54,616 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:54,619 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:54,619 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:54,621 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:54,621 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:54,623 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:54,625 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 17:34:54,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:34:54,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 544 treesize of output 596